How much information is in a password? Shannon entropy measures its unpredictability in bits — and reveals why length beats a scramble of symbols.
Shannon Entropy & PasswordsLive
measuring information & strength
Entropy
60bits
brute-force time: 1 yr
Controls
Shannon entropy measures information in bits — how many yes/no questions it takes to pin down a value. For a password it is length times the log₂ of the character-set size, quantifying how unpredictable it is. Each extra bit doubles the guessing effort, so length beats complexity: a long passphrase can carry more entropy than a short scramble of symbols.
★ Sign in to save this setupSave your tuned setup, or drop this simulation into your own site, docs, or course page.
How it works
Shannon entropy quantifies information as the number of yes/no questions needed to determine a value. For a password it is the length times the log₂ of the character-set size, measuring how hard it is to guess. Each additional bit doubles the brute-force effort, so a long passphrase can be far stronger than a short, complex string. The foundation of information theory.
✦
Ask the AI about this model
The math, the assumptions, real-world uses, or a code translation — explained for this exact simulation.
Is this Shannon entropy password strength tool really free?▾
Yes. Shannon Entropy & Passwords runs entirely in your browser using your device's own compute, so local use is free forever. You only pay Compute Tokens if you scale a job to the cloud.
Do I need to install anything?▾
No. Everything runs client-side in a modern browser — no downloads, no license, no account required to start.
Can I save or share my simulation?▾
Create a free account to save projects, and use a shareable embed or minted DOI to publish a live, interactive version anywhere.
How accurate are the results?▾
The solver uses established numerical methods, but results are for research and educational purposes and should be validated against experiment or professional review before you rely on them.