What Is Password Entropy?
Password entropy is a measure of how unpredictable a password is, expressed in bits. Each additional bit doubles the number of guesses an attacker must make. A password with 40 bits of entropy requires up to \(2^{40}\) (about a trillion) attempts to brute-force, while 80 bits is astronomically stronger. Entropy is the single most useful objective number for comparing password strength.
How to Use This Calculator
Enter your password length and tick every character set your password draws from. The tool adds up the pool sizes — lowercase (26), uppercase (26), digits (10) and symbols (32) — to get the character-set size N, then computes the entropy. More length and more character types both increase entropy, but length usually delivers the biggest gain.
The Formula Explained
The standard formula is $$E = L \times \log_{2}(N)$$ where \(L\) is the number of characters and \(N\) is the size of the character pool. Because each position can independently be any of \(N\) symbols, the total number of possible passwords is \(N^{L}\), and \(\log_{2}\) of that gives the bits of entropy. This assumes a truly random password; a dictionary word or predictable pattern has far less effective entropy than the formula suggests.
Worked Example
Take a 12-character password using lowercase, uppercase and digits. The character pool is \(26 + 26 + 10 = 62\). $$E = 12 \times \log_{2}(62) = 12 \times 5.954 \approx 71.45 \text{ bits}$$ That corresponds to roughly \(2^{71.45} \approx 3.2 \times 10^{21}\) combinations — extremely resistant to brute force.
Interpreting Your Entropy Result
Entropy in bits measures how many guesses an attacker would need if your password were chosen uniformly at random from the character set. The calculator uses \(E = L \times \log_2(N)\), where \(L\) is the length and \(N\) is the character pool size (26 lowercase, 26 uppercase, 10 digits, 32 symbols).
| Entropy | Rating | Meaning |
|---|---|---|
| Under 28 bits | Very weak | Falls almost instantly to any guessing attack |
| 28–35 bits | Weak | Protects only against casual, trivial guessing |
| 36–59 bits | Reasonable | Fine for low-value accounts, but vulnerable to offline attacks on fast hashes |
| 60–79 bits | Strong | Resists most offline attacks for years |
| 80+ bits | Very strong | Beyond realistic brute force with current hardware |
Each bit doubles the guesses
A password with \(E\) bits has \(2^E\) equally likely possibilities. Adding one bit doubles the search space, and adding 10 bits multiplies it by about 1,000 (\(2^{10} = 1024\)).
How crack time is derived
On average an attacker finds the password after searching half the space, so:
$$t_{\text{avg}} = \frac{ 2^{E-1} }{ R }$$
where \(R\) is guesses per second. This calculator assumes \(R = 10^{10}\) (10 billion guesses/sec). Example for a 60-bit password:
$$t = \frac{2^{59}}{10^{10}} = \frac{5.764 \times 10^{17}}{10^{10}} \approx 5.764 \times 10^{7}\ \text{s} \approx 1.8\ \text{years}$$
(using 1 year ≈ 31,557,600 seconds).
Important caveats
- The result assumes every character was chosen randomly and independently. Human-chosen passwords (words, names, dates, "Password1!") have far less real entropy than the formula suggests, because attackers try common patterns first.
- The 10 billion/sec figure models fast, unsalted hashes (such as MD5 or SHA-1) attacked offline with GPUs. Slow, salted hashes such as bcrypt, scrypt or Argon2 reduce the attacker's rate by orders of magnitude, so real crack times can be much longer.
- Online attacks are usually rate-limited, which helps further, but a leaked hash database removes that protection.
- Reusing a password across sites defeats its entropy: one breach exposes it everywhere.
Character Set Sizes Reference
Bits per character is \(\log_2(N)\). Multiply it by the password length to get entropy, provided each character is chosen uniformly at random from the set.
| Character set | Size N | Bits per character (log2 N) |
|---|---|---|
| Digits only (0–9) | 10 | 3.32 |
| Lowercase letters (a–z) | 26 | 4.70 |
| Uppercase letters (A–Z) | 26 | 4.70 |
| Lowercase + uppercase | 52 | 5.70 |
| Alphanumeric (letters + digits) | 62 | 5.95 |
| Printable ASCII symbols | 32 | 5.00 |
| Full printable ASCII (letters, digits, symbols) | 94 | 6.55 |
| Hexadecimal (0–9, a–f) | 16 | 4.00 |
| Base64 alphabet | 64 | 6.00 |
| Diceware word list (per word) | 7776 | 12.92 |
The calculator adds the sizes of the selected sets: \(N = 26 + 26 + 10 + 32 = 94\) when all four boxes are ticked. The 32 symbols are the standard printable ASCII punctuation characters. Keyboards or sites that allow other characters (such as accented letters or emoji) have a larger pool, while sites that restrict symbols have a smaller one.
FAQ
How many bits is "strong"? 60+ bits is decent for most accounts; 80+ bits is recommended for high-value or master passwords.
Does this account for dictionary attacks? No. The formula assumes random characters. Real words, names and substitutions reduce true entropy dramatically — use a random generator or passphrase.
Why use 10 billion guesses/sec? It is a reasonable estimate for a well-funded offline attack on fast-hashed passwords; slower hashing slows attackers further.