Rainbow table
A rainbow table is a precomputed structure of chained password-hash values that accelerates recovery of plaintext passwords from unsalted hashes by trading storage for lookup time.
Hacking Cryptography
A rainbow table is a precomputed structure of chained password-hash values that trades storage space for lookup time when recovering likely plaintext passwords.
- How it is used
- Demonstrates cracking leaked password hashes through a precomputed dictionary-attack space-time trade-off.
- How deep it goes
- Implements chain generation, column-specific reductions, endpoint lookup, and replay verification, while noting chain merging and false alarms.
- Examples
- Uses a six-character SHA-256 password space, 1,000-step chains, millions of rows, and a 100-user cracking test.
- What you can do after
- Build it from scratch by generating chains, storing endpoints, locating candidate chains, and verifying recovered passwords.
Fundamentals of Cybersecurity
A rainbow table is a precomputed collection of password candidates and corresponding hash values used to accelerate hash cracking.
- How it is used
- Frames rainbow tables as an attacker shortcut for cracking accessible, unsalted password hashes rather than guessing through a login.
- How deep it goes
- Explains precomputed hash lookup and salting’s effect, but does not describe how to construct a table.
- Examples
- Contrasts stored-hash lookup with hashing dictionary guesses and provides a table comparing password attacks and defenses.
- What you can do after
- Evaluate/understand the risk posed by unsalted password hashes and identify salting as a defense against precomputed lookups.
Read how Fundamentals of Cybersecurity explains rainbow table →
What to know first
- hash valueA hash value is a deterministic, typically fixed-size value produced by applying a hash function to input data, often for lookup, comparison, identification, or integrity checking.
Related concepts
- dictionary attackkind of · A dictionary attack is a credential-guessing technique that tests candidate passwords or values drawn from a prepared list of common or likely choices.
- hash chainhas part · A hash chain is a linked sequence of hash-table entries stored in one bucket to handle multiple keys that produce the same hash value.
- hash functionuses · A hash function is a deterministic function that maps input data to a hash value, typically of fixed size, for uses such as lookup, indexing, comparison, or integrity checking.
- cryptographic saltaddressed by · A cryptographic salt is an additional, typically random value combined with input before hashing to distinguish identical inputs and make precomputed attacks less effective.
- password authenticationaddresses · Password authentication is a method of verifying a claimed identity or access by checking a supplied secret password, often alongside a user identifier.
Questions about rainbow table
What is rainbow table?
A rainbow table is a precomputed structure of chained password-hash values that accelerates recovery of plaintext passwords from unsalted hashes by trading storage for lookup time.
Which Manning books explain rainbow table?
Hacking Cryptography and Fundamentals of Cybersecurity.
What should I know before learning rainbow table?
Manning books that teach rainbow table usually introduce hash value first.
What is rainbow table a kind of?
Rainbow table is a kind of dictionary attack. A dictionary attack is a credential-guessing technique that tests candidate passwords or values drawn from a prepared list of common or likely choices.
What are the parts of rainbow table?
Rainbow table includes hash chain.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

