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

