What is the purpose of rainbow tables in password cracking?

What is the purpose of rainbow tables in password cracking?

• A. To monitor network traffic
• B. To speed up cracking by using precomputed hashes
• C. To store user credentials securely
• D. To seed random numbers

Answer: (B)

Rainbow tables speed up password cracking by turning the process into a quick lookup using precomputed hash-to-password mappings. Instead of trying a candidate password and hashing it each time, an attacker creates a massive table that pairs many possible passwords with their resulting hash values. When a target hash is seen, the attacker searches the table to find the precomputed password that produced it, dramatically reducing the time needed to crack. These tables often use reduction functions to chain many candidate passwords together, which helps reduce storage requirements compared to storing every single hash-result pair. However, this approach works best against unsalted hashes. If a salt is applied to each password, the hash changes with the salt, so an attacker would need a separate rainbow table for every possible salt value, making the tactic much less practical for modern password storage schemes that use strong, unique salts (like bcrypt, scrypt, or Argon2). Rainbow tables do not relate to monitoring network traffic, securely storing credentials, or seeding random numbers.

Rainbow tables speed up password cracking by turning the process into a quick lookup using precomputed hash-to-password mappings. Instead of trying a candidate password and hashing it each time, an attacker creates a massive table that pairs many possible passwords with their resulting hash values. When a target hash is seen, the attacker searches the table to find the precomputed password that produced it, dramatically reducing the time needed to crack. These tables often use reduction functions to chain many candidate passwords together, which helps reduce storage requirements compared to storing every single hash-result pair.

However, this approach works best against unsalted hashes. If a salt is applied to each password, the hash changes with the salt, so an attacker would need a separate rainbow table for every possible salt value, making the tactic much less practical for modern password storage schemes that use strong, unique salts (like bcrypt, scrypt, or Argon2). Rainbow tables do not relate to monitoring network traffic, securely storing credentials, or seeding random numbers.