Skip to content
Password Generator Lab

Password entropy calculator

See what length and character choices really buy you — in bits, and in time to guess.

Start from a preset

94 printable characters, 62 letters and digits, 7,776 EFF words, 10 digits…

characters
Entropy
131.1 bits
Possible outcomes
≈ 1039
Rating (random secrets)
Very strong

Formula: 20 × log₂(94) = 131.09 bits.

Average time to guess

ScenarioAverage time
Online, rate-limited
Login form that limits attempts (100 per hour)
≈ 1033 years
Online, no rate limit
Poorly protected login (10 per second)
≈ 1030 years
Offline, slow hash
Stolen database with bcrypt/Argon2 (10 thousand per second)
≈ 1027 years
Offline, fast hash
Stolen database with a fast hash (10 billion per second)
≈ 1021 years
Massive offline cluster
Well-funded attacker, fast hash (1 trillion per second)
≈ 1019 years

For scale: the universe is about 1.4 × 1010 years old. Assumes each position is chosen uniformly at random and the attacker knows your exact settings — only then is entropy meaningful. For a password you made up, use the strength checker instead.

Key facts

  • Entropy in bits = length × log₂(number of possible choices per position).
  • Each extra bit doubles the possibilities; on average an attacker must search half of them.
  • One more random character from 94 adds about 6.55 bits (log₂ 94); enabling symbols (62 → 94 characters) adds only about 0.6 bits per character.
  • Entropy only describes randomly generated secrets, not passwords people invent.

Last reviewed

What entropy means

Entropy measures how many equally likely outcomes a random process can produce, counted in bits: each bit doubles the possibilities. If every position of a secret is picked uniformly from N options and there are L positions, the entropy is L × log₂(N).

An attacker who knows exactly how the secret was made — the character set, the length, the wordlist — still has to try, on average, half of all 2bits possibilities. That's what the time estimates above show.

Length beats complexity

Adding symbols to a random password grows N from 62 to 94, adding about 0.6 bits per character. Adding one more character adds about 6.55 bits. Both help, but length helps far more — which is why modern guidance focuses on length. The password length guide turns this into recommended lengths, with guessing times for 8 to 20 characters.

When entropy doesn't apply

The formula assumes a random choice. A password a person invents — Summer2026! — has 11 characters from a 94-character set, so the formula claims 72 bits, yet it sits near the top of every cracking list. For human-chosen passwords, use the strength checker, which models how attackers actually guess.

About the attack speeds

Real speeds depend on the hashing algorithm, hardware and budget. Rate-limited online attacks are slowest; offline attacks on a stolen database with a fast, unsalted hash are fastest. The five scenarios are round numbers that span that range — treat the results as orders of magnitude, not promises.

Sources

Frequently asked questions

How many bits of entropy is enough?
For a password stored in a password manager, 80 bits or more is comfortable against offline attacks; our default 20-character password has about 131. For things protected by rate limiting, such as a phone PIN, far less is acceptable.
Why does your generator sometimes show slightly less than L × log₂(N)?
When it requires every character type, passwords missing a type are excluded. We count the remaining possibilities exactly, which is a little fewer than the simple formula.
Do quantum computers change this?
Grover's algorithm could in theory halve the effective bits of a brute-force search, but practical attacks on passwords remain limited by hashing and rate limits. A long random password stays a strong choice.

Related guides

More generators