How the Math Works
A password or key drawn from a character set of size c and length L has a keyspace of cL possible values. A symmetric key of b bits has a keyspace of 2b. On average, an exhaustive brute-force search finds the correct value after checking half the keyspace — not all of it, since the attacker could get lucky early or unlucky late, and half is the statistical expectation. Divide that average number of guesses by the attacker's guesses-per-second, and you get the estimated time to crack.
What Grover's Algorithm Changes
A quantum computer running Grover's algorithm against an unstructured search space needs only about √N queries instead of N/2 — a quadratic speedup, not the exponential break that Shor's algorithm gives against RSA and ECC. In practice, this means a 128-bit key facing Grover's algorithm has roughly the effective security of a 64-bit key against classical brute force — still meaningfully secure, but with a much smaller margin. This is exactly why NIST recommends AES-256 rather than AES-128 for genuinely long-term quantum-resistant symmetric encryption: doubling the key length restores the security margin Grover's algorithm would otherwise erode.
An important limitation of this calculator: when you enable the Grover's-algorithm option above, the tool applies whatever classical guesses-per-second figure you selected directly to Grover's query count. That's a simplification made for comparison purposes, not a claim about real quantum hardware speed. Each Grover query requires executing a deep, error-corrected quantum circuit — nothing like the simple hash computation a classical GPU or ASIC performs, and no existing or near-term quantum computer can run Grover's algorithm against a 128-bit keyspace at any practical speed. Treat the Grover result as "how many queries the algorithm needs," not "how long an actual attack would take today."
Why Password Composition Matters More Than People Expect
| Composition | 8 Characters | 12 Characters |
|---|---|---|
| Lowercase only (26 chars) | ~2×1011 combinations | ~9.5×1016 combinations |
| Mixed case + digits (62 chars) | ~2×1014 combinations | ~3.2×1021 combinations |
| Full symbol set (94 chars) | ~6×1015 combinations | ~4.8×1023 combinations |
Length matters more than character set diversity for most practical purposes — going from 8 to 12 characters at the same character set typically adds far more combinations than adding symbols to an 8-character password. Try both in the calculator above to see the gap directly.