Home / Password & Passphrase Tools / Password Length Calculator
Password & Passphrase Tools

Password Length Calculator

Calculate the minimum length for a uniformly random password target, or check the theoretical bits for a chosen length—without pasting a real password.

Use the pool your generator actually chooses from uniformly.
Minimum random length
20 characters
≈ 131.1 theoretical bits with a 95-symbol pool
131.1 bitsTheoretical entropy
95Equally likely choices / draw
10^39.5Search-space size
This math assumes every position is selected uniformly and independently. It does not score a human-chosen password.

Pool comparison for this target

Uniform poolPool sizeMinimum lengthBits at that length

Length ladder for the selected pool

LengthTheoretical bitsSearch spaceNIST length reference
Illustrative brute-force scenario
—Average exhaustive-search time at this illustrative rate

This is a search-space illustration, not a prediction of a real account compromise. Real resistance depends on how a verifier stores passwords, rate limits, MFA, attack strategy, and whether the secret was actually generated uniformly.

NIST password-policy referenceFor password-only authentication, NIST SP 800-63B-4 sets a 15-character minimum. When a password is used as part of MFA, the minimum is 8 characters. Verifiers should permit at least 64 characters and should not impose composition rules.

Use this calculator for generator/policy planning. Do not paste a real password here: the theoretical formula H = length × log₂(pool size) is only valid when draws are uniform and independent.

What this calculator can and cannot tell you

For a generator that selects every draw uniformly and independently, theoretical entropy is length × log₂(pool size). Human choices, reused phrases, keyboard patterns, substitutions, breached passwords, and biased generators do not satisfy that assumption, so this page intentionally does not ask you to paste a real password or turn naive pool math into a “strength score.”

Length matters, but policy and storage matter too

Use unique randomly generated passwords, a password manager, MFA where available, and service-side compromised-password blocking. Illustrative brute-force time is highly sensitive to verifier storage and rate limiting, so it is shown only as an optional scenario rather than the main answer.

Practical guide and verification

Length targets depend on how passwords are generated

A uniformly random password from a known alphabet has quantifiable search space, while a human-chosen password of the same length can be far more predictable. Do not apply random-password entropy formulas directly to memorable patterns or reused phrases.

Attack-rate assumptions can change results by many orders of magnitude

Offline cracking speed depends on the password hash, hardware, cost parameters and attacker resources. Treat crack-time output as a scenario based on the chosen rate rather than a universal promise of how long a real account will resist.

Online authentication is governed by rate limits too

For a well-designed online service, throttling, lockout, MFA and anomaly detection can dominate raw password search speed. Password length still matters, but the offline and online threat models should not be mixed into one number.

Longer is usually more robust than complicated composition rules

When a system allows it, increasing a randomly generated password or passphrase length expands the search space without relying on hard-to-remember substitution tricks. Check the destination maximum length and supported characters before generating a credential.

Use the calculator to set a policy, then verify the generator

After choosing a target entropy or length, confirm that the actual password generator uses the assumed alphabet and secure randomness. A policy estimate is only valid when the issued credentials match the generation model used in the calculation.

Search by task, tool name, or category. Press Esc to close.
Start typing to find a tool.