Security · Calculator
Password entropy, in bits.
Work out how many bits a randomly generated password or Diceware passphrase carries. Nothing you enter leaves this page.
How to calculate password entropy
- Choose the type: random characters or Diceware words.
- For characters, tick the sets that were used and enter the length. For words, choose the word list and enter the number of words.
- Optionally set the attacker's guesses per second.
- Read the entropy in bits and the estimated time to guess.
What entropy tells you
Entropy measures how unpredictable a secret is, in bits. For random characters it is the length multiplied by the base-2 logarithm of the pool size, so a 16-character password drawn from 62 letters and digits carries about 95 bits. For Diceware, it is the number of words multiplied by the logarithm of the list size: the EFF long list of 7,776 words gives about 12.9 bits per word, so six words give 77 bits, and the short list of 1,296 words gives about 10.3 bits per word.
Every extra bit doubles the number of guesses required, and on average an attacker needs to try half the space. The calculation applies only to secrets generated randomly. A password you made up, however complex it looks, has far less entropy than the formula suggests, because people choose predictable patterns.
Nothing is sent anywhere
The calculator runs in your browser, inside an isolated frame on this page that has no network access. Your file is read and written back by your own device, so it is not uploaded to TNAADO or anyone else, and nothing is stored. The advertising on this page sits outside the frame and cannot see what you choose. You enter only lengths and settings, never the secret itself.
- Treat guesses per second as an assumption; offline attacks on weak hashes can be very fast.
- Aim for 70 bits or more for important accounts.
How it works
- Characters: entropy = length × log2(pool size). A 16-character password from 62 letters and digits carries about 95 bits.
- Diceware words: entropy = words × log2(list size). The EFF long list holds 7,776 words (65, five dice), so each word adds about 12.9 bits and six words give 77 bits; its short list (1,296 words) gives 10.3 bits per word (EFF).
- Guesses: every extra bit doubles the guesses needed. On average an attacker finds the secret after half the search space, 2bits−1 guesses. The time shown uses the guess rate you enter; it is arithmetic, not a prediction.
- Only for random secrets: the formulas assume every character or word was chosen uniformly at random. NIST SP 800-63B notes that estimating entropy for user-chosen passwords is challenging, so a password you made up cannot be scored this way. For that, use the Password Strength Checker; to get a random one, use the Diceware generator.
What "bits of entropy" means
Entropy, as used for passwords, counts how many equally likely secrets an attacker would have to search. A secret with b bits has 2b possibilities, so every extra bit doubles the work. It is a measure of the process that produced the secret, not of how a finished string looks. That is why this calculator only applies to secrets chosen uniformly at random, by a generator or by dice, and why it asks for the pool you drew from instead of the password itself.
The two formulas
- Random characters: entropy = length × log2(pool size). The pool is the number of distinct characters each position could be. The tool uses 26 for a-z, 26 for A-Z, 10 for digits, 32 for symbols and 1 for the space, plus any extra distinct characters you add. All four sets plus space give 95.
- Random words (Diceware): entropy = number of words × log2(word list size). The EFF long list has 7,776 words, about 12.9 bits each; its short lists have 1,296 words, about 10.3 bits each.
The average number of guesses to find the secret is half the search space, 2b−1, which is what the time estimate uses with the guess rate you enter.
Worked examples
- 16 characters from letters and digits (pool 62): log2(62) is about 5.95 bits, so 16 characters give about 95.3 bits.
- 8 characters from all 95 printable ASCII characters: 8 × 6.57 = about 52.6 bits. At a hypothetical ten billion guesses per second, an average search takes about 92 hours, under four days. That is why short passwords fail against offline attacks even with symbols.
- 12 characters from the same 95: about 78.8 bits, which at the same rate is on the order of a million years on average.
- 6 words from the 7,776-word list: 6 × 12.92 = about 77.5 bits. Four words give about 51.7 bits.
The "For 80 bits" and "For 128 bits" lines show how long a secret has to be for your pool. For 80 bits you need 14 characters from a 62-character pool, 13 from a 95-character pool, or 7 words from a 7,776-word list. These are round targets for comparison, not an official standard.
What entropy does not tell you
- Human-chosen passwords. If you invented "Tr0ub4dor&3", the pool-and-length formula overstates its strength, because people follow patterns that attackers try first. NIST SP 800-63B notes that estimating the entropy of user-chosen passwords is difficult, which is why the formulas here are for generated secrets only. Use the Password Strength Checker for a password you already have.
- Attacker speed. The guess rate depends on how the service stores your password. A fast hash allows billions of guesses per second; a slow, salted password hash allows far fewer. The rate box is an assumption you control.
- Reuse and phishing. A 100-bit password is no help if you typed it into a fake login page or used it on a site that leaked it.
Length over complexity rules
NIST SP 800-63B-4 sets minimum lengths instead of character-mix rules: at least 15 characters when a password is the only authentication factor and at least eight when it is used with a second factor, and verifiers should allow at least 64 characters and must not impose composition rules such as requiring a symbol. The arithmetic agrees: adding a character to a random password multiplies the search space by the pool size, while adding a required symbol to a short one barely moves it. To make a strong secret rather than measure one, use the Diceware Passphrase Generator or the Password Generator.
Common mix-ups
-
Often assumedIf I type the password I made up into an entropy formula, the bits it prints tell me how hard it is to guess.
What the source saysNIST SP 800-63B-4 notes that entropy is easy to calculate when the distribution is known, but estimating it for user-chosen passwords is challenging. The bit count is only meaningful for secrets picked uniformly at random. [1]
Checked against these sources on .
Frequently asked questions
How do you calculate password entropy?
Multiply the password length by log base 2 of the size of the pool of characters it was drawn from. A 16-character password from 62 letters and digits has 16 × log2(62), about 95 bits. For random words, multiply the number of words by log2 of the word list size.
How many bits of entropy is a strong password?
There is no single official number. Many people aim for at least 80 bits for a secret that could face offline guessing, and 128 bits is a common very-high target. The right amount depends on how the password is stored and how long it must stay secret.
Can I enter my own password here to see its entropy?
Not meaningfully. The formulas assume every character or word was chosen uniformly at random. A password you made up follows human patterns, so its real strength is lower than the arithmetic suggests, and NIST notes that estimating it is challenging.
How much entropy does each Diceware word add?
About 12.9 bits for a word from the 7,776-word list, and about 10.3 bits for a word from a 1,296-word short list. Six long-list words give about 77.5 bits.
Does adding symbols or capital letters make a password much stronger?
Only a little unless the length is big enough. Going from 62 to 95 possible characters adds about 0.6 bits per character, while adding one more random character adds about 6.6 bits. NIST SP 800-63B-4 discourages composition rules for this reason.
What does the crack-time estimate mean?
It is the average time to search half the possibilities at the guesses per second you enter. It is arithmetic, not a prediction. Real attack speed depends on the hashing algorithm, salts and the attacker's hardware.
Is anything I type sent to a server?
No. The calculation runs in your browser and nothing you enter leaves the page. Because the tool only needs pool sizes and lengths, you never have to type a real password.
Sources
- NIST SP 800-63B-4: Authentication and Authenticator Management: 15- and 8-character minimums, 64-character maximum, no composition rules (retrieved 2026-10).
- NIST SP 800-63B-4, Appendix A: Strength of Passwords: estimating entropy for user-chosen passwords is challenging; length-based approach (retrieved 2026-10).
- Diceware Passphrase Home Page (Arnold Reinhold): 12.9 bits per word, 64.6 bits for five words, 77.5 for six (retrieved 2026-10).
- EFF: Deep Dive, New Wordlists for Random Passphrases: 1,296-word short lists and bits per word (retrieved 2026-10).
- EFF: Dice-Generated Passphrases: EFF long wordlist and six-word suggestion (retrieved 2026-10).