An attacker uses a tool that precomputes hash chains for common passwords to crack password hashes quickly. Which technique is the attacker employing?
A rainbow table attack leverages large, precomputed tables containing hash chains generated using a specialized reduction function. These tables map hashes back to their original plaintext values by performing a lookup rather than real-time computation. When a target hash is found within the table, the corresponding chain is traversed to recover the original password, making it highly efficient for cracking hashes quickly without needing to recompute every possible password combination.
Why this answer
Rainbow table attack. This technique involves precomputing hash chains for common passwords and storing them in a table, allowing the attacker to reverse password hashes quickly by looking up the hash in the table rather than computing hashes on the fly. The tool described matches the core concept of a rainbow table, which uses a time-memory trade-off to crack hashes efficiently.
Exam trap
The trap here is that candidates confuse a rainbow table attack with a dictionary attack, because both involve lists of passwords, but the key distinction is precomputation versus real-time hashing.
How to eliminate wrong answers
Option A is wrong because a dictionary attack uses a list of plaintext passwords, hashing each one and comparing to the target hash in real time, not precomputed hash chains. Option B is wrong because a brute-force attack tries every possible combination of characters sequentially, without any precomputation or stored hash chains. Option C is wrong because a hybrid attack combines dictionary words with variations (e.g., appending numbers or symbols), but it still computes hashes on the fly rather than relying on precomputed chains.