An attack that uses the cryptanalytic time-memory trade-off technique, which requires less time than other techniques, creates a table of all the possible passwords and their respective hash values in advance. What is this attack called?

An attack that uses the cryptanalytic time-memory trade-off technique, which requires less time than other techniques, creates a table of all the possible passwords and their respective hash values in advance. What is this attack called?

• A. RainbowCrack
• B. Rainbow Table Attack
• C. Computed Hashes
• D. rtgen

Answer: (B)

The concept being tested is the use of precomputed hash tables to speed up password cracking, a method that embodies the time-memory trade-off. In this approach, a large table is created in advance that maps many possible passwords to their hash values. When an attack runs, it can quickly look up a hash and find the corresponding password, rather than trying guesses on the fly. This front-loaded effort lets the attacker spend less time during the actual cracking phase, trading storage and upfront computation for faster results. This attack is known as a rainbow table attack. Rainbow tables specifically use chains and reduction functions to cover a vast space of passwords while keeping storage feasible, so the lookup remains efficient. Tools like RainbowCrack implement this approach, and rtgen is a generator used to build rainbow tables—not the attack name itself. Computed hashes isn’t a standard term for this technique, so it doesn’t describe the attack. Additionally, rainbow tables are less effective against salted hashes, since salting requires separate tables for each salt value.

The concept being tested is the use of precomputed hash tables to speed up password cracking, a method that embodies the time-memory trade-off. In this approach, a large table is created in advance that maps many possible passwords to their hash values. When an attack runs, it can quickly look up a hash and find the corresponding password, rather than trying guesses on the fly. This front-loaded effort lets the attacker spend less time during the actual cracking phase, trading storage and upfront computation for faster results.

This attack is known as a rainbow table attack. Rainbow tables specifically use chains and reduction functions to cover a vast space of passwords while keeping storage feasible, so the lookup remains efficient. Tools like RainbowCrack implement this approach, and rtgen is a generator used to build rainbow tables—not the attack name itself. Computed hashes isn’t a standard term for this technique, so it doesn’t describe the attack. Additionally, rainbow tables are less effective against salted hashes, since salting requires separate tables for each salt value.