nerdexam
Mile2_Security

ML0-320 · Question #197

Cracking encryption is often impossible due to time constraints whereby it would take hundreds of years in some cases. Great advancement has taken place lately regarding the cracking of password…

The correct answer is C. Pre Computed hashes tables. See the full explanation below for the reasoning.

Question

Cracking encryption is often impossible due to time constraints whereby it would take hundreds of years in some cases. Great advancement has taken place lately regarding the cracking of password based on the time memory trade-off. Such an attack allows an attacker to crack the password within a very short period of time. Under the memory trade-off technique, which of the followig would be used to speed the cracking of password?

Options

  • ALarge dictionaries
  • BLarge collection of common passwords
  • CPre Computed hashes tables
  • DPre sorted dictionaries will most likely matches tried first

How the community answered

(59 responses)
  • A
    3% (2)
  • B
    12% (7)
  • C
    78% (46)
  • D
    7% (4)

Community Discussion

No community discussion yet for this question.

Full ML0-320 Practice