By Dhruv Chheda · Updated 21 November 2026
What entropy measures
Entropy is measured in bits. A password with N bits of entropy is one of 2^N equally likely possibilities, so an attacker needs on average 2^(N-1) guesses to find it. Each additional bit doubles the work.
How to calculate it
For a password chosen uniformly at random: entropy = length × log2(pool size). The pool is the number of different characters the password could use.
- Lowercase only (26): about 4.7 bits per character.
- Lowercase, uppercase and digits (62): about 5.95 bits per character.
- All printable symbols (94): about 6.55 bits per character.
So 12 random characters from 94 gives about 79 bits, while 12 random lowercase letters gives only about 56 bits. For passphrases, each word from a 7,776-word list adds about 12.9 bits.
Why 'random' is the key word
The formula only applies if each character really is chosen at random. A human-chosen password like 'Summer2024!' looks like it uses four character types, but attackers guess patterns like a word, a year and a symbol first, so its true strength is far lower than the formula suggests. That's why generated passwords matter.
How much entropy is enough?
- Under 40 bits: weak. Can be cracked quickly with modern hardware.
- 40 to 60 bits: fair. Fine only for low-value accounts with rate-limited logins.
- 60 to 80 bits: strong for most accounts.
- 80 bits or more: very strong, suitable for your email and password manager.
Reading a strength estimate
The strength checker estimates entropy from length and character types, then subtracts for repeated runs, sequences and very common passwords. Crack-time figures assume an offline attacker making 10 billion guesses per second against a fast hash. They're a useful comparison, not a promise: real systems vary, and a leaked password is weak however long it is.
To get a high score without effort, generate a password with the password generator or a passphrase with the passphrase generator.