Which table is used to convert huge word lists (i.e., dictionary files and brute-force lists) into password hashes?

Which table is used to convert huge word lists (i.e., dictionary files and brute-force lists) into password hashes?

• A. Hash tables
• B. Rainbow tables
• C. Master file tables
• D. Database tables

Answer: (B)

Rainbow tables are precomputed tables that map large word lists—like dictionary or brute-force candidates—to their hash values. The idea is to do the heavy lifting once: you generate hashes for many possible passwords and store them so you can quickly match a given hash to a plaintext candidate later. To save storage, rainbow tables use chains: each chain starts with a plaintext, then you repeatedly hash and apply a reduction function to move from hash to a new plaintext, building a sequence and storing only the chain’s first and last values. When you encounter a hash you’re trying to crack, you locate a matching end value in the table and follow the chain backward to recover the corresponding plaintext password. This approach is specifically designed for turning huge word lists into hashes and then reversing hashes efficiently. Note that salted hashes reduce the effectiveness of rainbow tables, since the salt changes the hash for every password; without matching salt, the table won’t help. The other terms listed aren’t techniques for precomputing hash mappings of dictionary or brute-force candidates.

Rainbow tables are precomputed tables that map large word lists—like dictionary or brute-force candidates—to their hash values. The idea is to do the heavy lifting once: you generate hashes for many possible passwords and store them so you can quickly match a given hash to a plaintext candidate later. To save storage, rainbow tables use chains: each chain starts with a plaintext, then you repeatedly hash and apply a reduction function to move from hash to a new plaintext, building a sequence and storing only the chain’s first and last values. When you encounter a hash you’re trying to crack, you locate a matching end value in the table and follow the chain backward to recover the corresponding plaintext password. This approach is specifically designed for turning huge word lists into hashes and then reversing hashes efficiently. Note that salted hashes reduce the effectiveness of rainbow tables, since the salt changes the hash for every password; without matching salt, the table won’t help. The other terms listed aren’t techniques for precomputing hash mappings of dictionary or brute-force candidates.