Which of the following password cracking attacks is based on a pre-calculated hash table to retrieve plain text passwords?

A rainbow table attack relies on large pre-calculated lookup tables that store chains of hash values and their corresponding plaintexts, generated offline before the attack begins. When an attacker obtains a password hash, they search the table to find the matching plaintext without performing any live hashing. This makes rainbow table attacks far faster than brute force or dictionary attacks for unsalted hashes, and is why salting passwords is a critical countermeasure.

A brute force attack systematically computes hashes for every possible character combination at attack time - it does not use any pre-calculated table.

A dictionary attack hashes words from a wordlist during the attack itself rather than consulting a pre-computed table, so it does not match the definition of a pre-calculated hash table attack.

A hybrid attack combines dictionary words with brute force mutations (such as appending numbers or symbols) and computes hashes on the fly, rather than looking up pre-calculated values.