312-49 Question #482: Real Exam Question with Answer & Explanation

The correct answer is A: Rainbow tables. Rainbow tables are precomputed lookup tables that store chains of hash values derived from large word lists or brute-force character sets. They allow attackers to reverse a password hash by looking it up in the table rather than hashing every candidate in real time, dramatically

Submitted by tunde_lagos· Apr 18, 2026Disk Forensics

Question

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

Options

ARainbow tables
BHash tables
CMaster file tables
DDatabase tables

Explanation

Rainbow tables are precomputed lookup tables that store chains of hash values derived from large word lists or brute-force character sets. They allow attackers to reverse a password hash by looking it up in the table rather than hashing every candidate in real time, dramatically speeding up offline password cracking. Hash tables are general data structures, not specifically for password cracking. Master File Tables (MFT) are NTFS filesystem structures. Database tables are generic relational storage â€” neither is purpose-built for password hash lookups.

Topics

#Rainbow tables#Password cracking#Hashing#Brute-force

Community Discussion

No community discussion yet for this question.

Full 312-49 Practice Browse All 312-49 Questions