Entropy in Passwords: What the Number Actually Means

Password entropy measures uncertainty in a password-generation process.

If a generator chooses uniformly from (N) equally likely possibilities, the entropy is:

H = log₂(N)

For independently generated characters chosen uniformly from an alphabet of size (S):

H = length × log₂(S)

The formula is straightforward. Applying it to a password a person invented is much less reliable.

Entropy Describes the Generation Process

Consider a four-digit PIN chosen uniformly from 0000 through 9999.

N = 10,000
H = log₂(10,000)
  ≈ 13.3 bits

That result follows because each of the 10,000 values is equally likely.

Now consider an eight-character string generated uniformly from 26 lowercase letters:

H = 8 × log₂(26)
  ≈ 37.6 bits

A 16-character string generated uniformly from 94 printable non-space ASCII characters has about:

H = 16 × log₂(94)
  ≈ 104.9 bits

These calculations describe the generation algorithm’s search space. They do not prove that an arbitrary password containing the same character types was generated with that much uncertainty.

Human Passwords Are Not Uniform Random Strings

A password such as:

Summer2026!

contains uppercase and lowercase letters, digits, and a symbol. Multiplying its length by the size of a broad character set would assign it an impressive-looking number.

An attacker does not normally guess human passwords in uniform character-set order. Cracking tools prioritize common words, dates, keyboard patterns, breached passwords, and predictable transformations.

The relevant question is therefore how likely the password was under the process that produced it.

A simple “length × alphabet size” meter can therefore substantially overstate the strength of a human-created password.

Each Bit Doubles an Idealized Search Space

For a uniform search space, adding one bit doubles the number of possibilities:

Entropy	Number of possibilities
20 bits	about 1 million
30 bits	about 1 billion
40 bits	about 1 trillion
60 bits	about 1.15 quintillion
80 bits	about 1.21 × 10²⁴
128 bits	about 3.40 × 10³⁸

The table describes mathematical search spaces. It does not translate directly into a cracking time without knowing the attacker’s guessing rate, password-hashing scheme, hardware, and attack strategy.

Random Passphrases Can Have Measurable Entropy

Passphrases can be analyzed cleanly when each word is selected independently and uniformly from a known list.

With a 7,776-word list:

4 words ≈ 51.7 bits
5 words ≈ 64.6 bits
6 words ≈ 77.5 bits

Those figures apply to random word selection. A sentence, quotation, lyric, or personally chosen sequence of words does not inherit the same entropy simply because it contains the same number of words.

A password manager or dice-based method can provide a generation process whose randomness is easier to reason about than human choice.

Online and Offline Guessing Are Different Problems

An online attacker sends guesses to the real authentication service. Rate limiting and other account protections can sharply restrict the number of attempts.

An offline attacker has obtained password-verifier data and can test guesses without sending each attempt to the service. The cost then depends heavily on how the password was stored, including the password hashing or key-derivation function and its parameters.

This distinction is why a table that labels a fixed entropy number “weak” or “strong” without an attack model can be misleading.

The same password can face very different guessing economics in the two situations.

Length Helps Without Making Human Choice Random

Longer passwords provide room for more possibilities, but length by itself does not turn a predictable construction into a random one.

Modern password guidance generally favors sufficient length, screening against common or compromised passwords, rate limiting, and support for password managers instead of forcing users to satisfy arbitrary mixtures of uppercase letters, digits, and symbols. NIST guidance also warns that estimating entropy for user-chosen passwords is difficult.

For generated passwords, length is especially useful because every additional independently random choice increases the search space in a measurable way.

Password Managers Can Generate Random Passwords

A password manager can generate a different random password for each service and store it without requiring the user to memorize every value.

That addresses two problems that entropy scores alone do not:

predictable human choice
password reuse

A high-entropy password reused across many sites can still be exposed through a breach at one of them. Entropy addresses guessing resistance; uniqueness between accounts addresses credential reuse.

Multi-factor authentication adds another control when a password is stolen or phished.

Use Entropy as a Model, Not a Password Grade

Entropy is precise when the probability distribution is known. For human-chosen passwords, a single displayed bit count is usually an estimate based on assumptions about how people choose strings and how attackers guess them.

For a password assessment, check:

Was the password generated randomly?
How large was the generation space?
Is it unique to this account?
How is the verifier stored?
Is online guessing rate-limited?
Is MFA available?

For randomly generated secrets, entropy measures the generator’s search space. Human-created passwords require a model of likely choices and attacker guesses; character variety alone cannot supply that model.