liveBook · Manning

Rainbow table

As explained in Fundamentals of Cybersecurity

A rainbow table is a precomputed collection of password candidates and corresponding hash values used to accelerate hash cracking.

A rainbow table is a precomputed lookup collection of likely passwords and their hash values. If an attacker gains access to stored password hashes, they can search the table for a match instead of calculating a hash for every guess. A match points to the corresponding password candidate. section 12.3.3

Lookup instead of repeated guessing

Suppose a workplace account’s stored password hash matches an entry for a common password. The table identifies the candidate without trying it at the login screen. In a dictionary attack, the attacker instead hashes each candidate and compares the result with the stored hash. section 12.3.3

Salting counters this shortcut. A unique random value is added to each password before hashing, so even identical passwords produce different stored hashes. Precomputed hashes of common passwords are then impractical as direct lookups. section 12.3.3 section 14.2.4

Attack
Definition
Defense
Hash
Login
Brute Force
Systematically tries all possible password combinations until the correct one is found.
Strong passwords, lockouts, MFA
Yes
Yes
Password Spraying
Attempts a small number of common passwords across many accounts to avoid account lockouts.
Lockouts, user training, MFA
No
Yes
Dictionary
Tests a predefined list of common passwords, words, and predictable variations to guess credentials.
Unique, passwords, MFA
Yes
Yes
Rainbow Table
Uses precomputed hash lookup tables to identify passwords from unsalted password hashes.
Salting, complex passwords
Yes
No

Compare which password attacks use stored hashes, which target logins, and which defenses address each one. section 12.3.3

How Fundamentals of Cybersecurity covers it

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 it assumes
Defines salting and explains hash comparison without requiring knowledge of hash implementation.
What you can do after
Evaluate/understand the risk posed by unsalted password hashes and identify salting as a defense against precomputed lookups.
How it connects
Links rainbow tables to password hashing, dictionary attacks, salting, and authentication attacks.

Also explained in

Compare how 2 books explain rainbow table →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Fundamentals of Cybersecurity. The section links point to the parts of the book it draws on.