How Password Entropy Works

How long would a computer need to guess your password? You can work out a fair answer with one short formula. The result is a number called entropy, and it is counted in bits.

Quick Answer

Password entropy counts how many guesses a random password could force, measured in bits. The formula is length times log base 2 of the pool size. Each extra bit doubles the guesses, so extra length usually beats extra symbols. The math only holds when a random process picks every character or word, not a person.

Entropy Counts Guesses in Bits

Entropy tells you how many passwords were possible when the password was made. Wikipedia describes password strength in bits, the base-2 logarithm of the number of guesses. A password with 42 bits needs up to 242 attempts.

The formula is short: entropy in bits = length x log2(pool size). The pool is the set of characters each position can use. Lowercase letters give a pool of 26, letters and digits give 62, and letters, digits and 18 symbols give 80.

Each character is worth log2 of the pool. That is 4.70 bits for 26, 5.95 bits for 62, and 6.32 bits for 80. If logs feel rusty, read logarithms explained simply.

Here is the key idea. Every extra bit doubles the guesses. Ten extra bits multiply them by about 1,000, and twenty extra bits by about 1,000,000.

Each extra bit doubles the guesses Three rising blocks, drawn for illustration and not to scale. The first block says plus 1 bit means 2 times the guesses. The second says plus 10 bits means about 1,000 times the guesses. The third says plus 20 bits means about 1,000,000 times the guesses. More bits means far more guesses +1 bit 2 times the guesses +10 bits about 1,000 times +20 bits about 1,000,000 times Block heights are for illustration, not to scale.
Small gains in bits turn into huge gains in guesses.

A Worked Example With 12 Characters From 80

Take a 12-character password picked at random from a pool of 80. Here is the full path from pool to years.

  1. Find the bits per character. log2(80) is 6.32. If your calculator only has a natural log, divide ln(80) by ln(2). Our guide to log vs ln vs log2 explains the buttons.
  2. Multiply by the length. 12 x 6.32 is 75.9 bits.
  3. Count the possibilities. 8012 is about 6.9 x 1022. See how to calculate powers, roots and reciprocals for the key presses.
  4. Halve it. An attacker finds the password after half the tries on average, or about 3.4 x 1022 guesses.
  5. Divide by speed. At 10 billion guesses per second, that is about 3.4 x 1012 seconds, or roughly 109,000 years.

The 10 billion figure is a stated assumption in our random password generator. It is not a fact about any real attacker, and it models a stolen list protected by a fast hash.

Why Length Beats Extra Symbols

Adding symbols helps less than most people expect. Growing the pool from 62 to 80 lifts each character from 5.95 to 6.32 bits. That is a gain of only 0.37 bits, while one more character adds 5.95 bits.

Compare two passwords. Twelve characters from 80 give 75.9 bits. Thirteen characters from letters and digits only give 77.4 bits, so the longer password wins even though its pool is smaller. A 16-character lowercase-only password reaches 75.2 bits, nearly the same as 12 from 80.

One more character multiplies the guesses by the pool size, which is 80 times at pool 80. Symbols are fine to include, but length is the bigger lever.

One extra character beats 18 extra symbols Two bars made of boxes, one box per character. The top bar has twelve teal boxes of 5.95 bits each plus one amber extra box, totaling 77.4 bits. The bottom bar has twelve navy boxes of 6.32 bits each, totaling 75.9 bits. The top bar is slightly longer, so one more character from the smaller pool wins. One box is one character. Wider boxes carry more bits. 13 characters from 62 (letters and digits) 77.4 bits 5.95 bits per character. The amber box is the one extra character. 12 characters from 80 (adds 18 symbols) 75.9 bits 6.32 bits per character. Eighteen extra symbols add less than one extra character. Example values; the pool sizes are 62 and 80.
One extra character from a small pool beats 18 extra symbols.

How Long Offline Guessing Would Take

Offline guessing means an attacker holds a stolen list of stored password fingerprints and tries guesses at full speed. The table uses the generator’s assumption of 10 billion guesses per second and the average case, which is half of all possibilities. Years use 365.25 days. For help reading the big numbers, see exponents and scientific notation.

Average offline guessing time at 10 billion guesses per second (planning estimate)
Setting Entropy Average time to guess
8 lowercase letters 37.6 bits about 10 seconds
8 from 62 (letters and digits) 47.6 bits about 3 hours
8 from 80 50.6 bits about 23 hours
12 lowercase letters 56.4 bits about 55 days
12 from 62 71.5 bits about 5,100 years
12 from 80 75.9 bits about 109,000 years
16 from 80 101.2 bits about 4.5 x 1012 years
20 from 80 126.4 bits about 1.8 x 1020 years
6 words, short list 62.0 bits about 7.5 years
8 words, short list 82.7 bits about 12.6 million years

A slow hash cuts the guess rate by orders of magnitude, which is why NIST wants slow hashing. Treat these as planning numbers, not predictions about any real attacker. No bit count makes a password unbreakable.

Random Words Versus Random Characters

A random passphrase is a good option when you must type the password by hand. The Diceware list has 7,776 words, one for each roll of five dice. EFF’s long list also has 7,776 words, worth about 12.9 bits each, and EFF suggests six words from it for 77 bits.

EFF’s short lists have 1,296 words, worth about 10.3 bits each. Our generator’s presets use the short list: six words give 62.0 bits and eight words give 82.7 bits. The chart shows how these compare with character passwords.

Entropy in bits for six settings Horizontal bars colored by the site’s rule-of-thumb bands. 8 lowercase letters is 37.6 bits (weak). 8 characters from 80 is 50.6 bits (fair). 6 words from the short list is 62.0 bits (strong). 12 from 80 is 75.9 bits (strong). 16 from 80 is 101.2 bits (very strong). 20 from 80 is 126.4 bits (very strong). A vertical line marks 80 bits. Entropy in bits, with the site’s bands 8 lowercase letters 37.6 bits 8 from 80 characters 50.6 bits 6 words, short list 62.0 bits 12 from 80 characters 75.9 bits 16 from 80 characters 101.2 bits 20 from 80 characters 126.4 bits

80 bits: very strong (site rule of thumb) under 40: weak 40 to 59: fair 60 to 79: strong 80 or more: very strong

The bands are our own rule of thumb, not a NIST standard.

The generator shows a verdict band for each result. The bands are the site’s own rule of thumb: under 40 is weak, 40 to 59 is fair, 60 to 79 is strong, and 80 or more is very strong. Its 20-character preset shows 126.3 bits, a hair under 126.4, because the rule of at least one character from each set removes a few possibilities.

Words only count when dice or a computer pick them. EFF notes that people are poor at making random choices.

What NIST Asks Services to Do

NIST SP 800-63B-4 sets rules for services, called verifiers, not for you. Still, the rules show what current guidance values: length and checks, not tricks.

  • Length: at least 15 characters when a password is the only sign-in factor, and at least 8 when it is only one part of multi-factor sign-in.
  • Room to type: services should allow at least 64 characters and accept printing ASCII characters, spaces and Unicode.
  • No composition rules: services shall not force mixes of character types.
  • No routine changes: services shall not require periodic changes, but must force one if there is evidence of compromise.
  • Blocklist: new passwords are compared with common, expected or compromised values.
  • Managers welcome: services shall allow password managers and autofill, and should permit paste.
  • Safe storage: passwords are salted and hashed with a suitable scheme, with the cost factor as high as practical.

NIST also says password managers have been shown to help people choose stronger passwords, especially when they include a generator.

Mistakes That Break the Math

  • Reusing a password. One leak then exposes every place that shares it.
  • Trusting patterns. P@ssw0rd1 follows habits many people share, so it is not random.
  • Editing by hand. Changing a generated password removes the randomness the bits depend on.
  • Picking passphrase words yourself. The figure only holds when a random process chooses them.
  • Trusting formulas for human choices. Entropy math overrates passwords that people invent.
  • Ignoring phishing and malware. They defeat any password, so turn on multi-factor sign-in.
  • Storing it unsafely. A strong password left where others can see it protects nothing.
Want to see the bits for your own settings?

Pick a length or a word count in the random password generator and read the entropy and offline guess time. Our page says it makes the password in your browser and sends nothing to a server.

FAQs About Password Entropy

How many bits of entropy make a password strong?

Our generator’s bands are a site rule of thumb, not a NIST standard: 60 to 79 bits is strong and 80 or more is very strong. NIST’s rules for services focus on length and blocklists.

Does adding symbols make a password much stronger?

Not much. Growing the pool from 62 to 80 adds only about 0.37 bits per character, while one extra character adds about 5.95 bits. Length is the bigger lever.

Is a passphrase stronger than random characters?

Only if the words are picked at random. Six words from EFF’s long list give about 77 bits. Twelve random characters from a pool of 80 give about 76 bits.

Why does each extra bit matter so much?

Each extra bit doubles the number of guesses needed. Ten more bits multiply the work by about 1,000, so small gains in bits add up fast.

Is P@ssw0rd1 a strong password?

No. It follows patterns many people use, so it is not random. Entropy formulas assume a random choice, so they overrate passwords that a person made up.

Does NIST require special characters or regular password changes?

No. NIST SP 800-63B-4 says services shall not impose composition rules or require periodic changes. A change is forced only on evidence of compromise. These are rules for services.

Does a high-entropy password stop phishing?

No. Phishing and malware can steal even a very strong password. Turn on multi-factor sign-in where you can, and never share a password.

Sources and Further Reading

References Used in This Article

This article explains the math of random passwords. Always follow the password rules of the site you are using, and turn on multi-factor sign-in where you can. Reviewed for accuracy by Prof. Dr. Khalil Mudassar, PhD. Last updated 2026-10-15.


Author

shakeel-Muzaffar
Founder & Editor-in-Chief at  ~ Web ~ More Posts

Shakeel is the Founder and Editor-in-Chief of MultiCalculators.com, with over 15 years of experience in digital publishing and online tool development. He oversees editorial quality, formula accuracy, and usability to ensure the platform delivers reliable, practical calculators for users worldwide.