What attack is used to crack passwords by using a precomputed table of hashed passwords?

A brute force attack systematically generates and hashes every possible character combination at runtime, with no precomputed table involved.

A rainbow table attack uses large precomputed data structures containing hash-to-plaintext mappings, enabling an attacker to crack an unsalted password hash through a fast lookup rather than recomputing hashes at runtime. This is why password salting is the standard countermeasure - a unique salt per password makes all precomputed rainbow tables useless by ensuring identical passwords produce different hashes.

A dictionary attack tests a predefined wordlist of common passwords against the hash at runtime, computing each hash as it goes rather than using any precomputed hash-to-plaintext mapping.

A hybrid attack combines dictionary words with brute force mutations such as appending numbers or symbols, but still computes hashes at runtime rather than relying on a precomputed table.