What concept do Rainbow Tables use to speed up password cracking?

Fast Lookup Crack Tables is not a recognized cryptographic or password cracking concept and does not describe the precomputed chain methodology used in rainbow tables.

Memory Swap Trades is not a defined term in cryptanalysis; it incorrectly conflates operating system virtual memory management with cryptographic attack techniques.

Disk Recall Cracking is not an established security concept and does not accurately represent the precomputed reduction chain approach that defines how rainbow tables function.

The time-memory trade-off (TMTO), formalized by Martin Hellman, is the core algorithmic principle behind rainbow tables. Rather than recomputing hashes on demand (pure time cost) or storing every possible hash-plaintext pair (pure memory cost), rainbow tables precompute and store reduction chains that allow an attacker to reverse an unsalted hash in seconds. This makes cracking common password hashes dramatically faster than brute-force methods, and is why salting is essential to defeat this attack.