Password & Secret Entropy Calculator
Measure the information-theoretic entropy of passwords and API keys to calculate realistic offline brute-force cracking resistance.
Password entropy uses the Shannon formula: Entropy (Bits) = Length × log₂(Pool Size). A password exceeding 60 bits resists online attacks; 80+ bits is required for offline database protection against modern multi-GPU hashcat arrays.
The Information Entropy Formula & NIST Standards
Entropy in cryptography describes the number of binary attempts an attacker must theoretically attempt to guess a secret:
E = L × log₂(R)
Where:
L= Character length of the passphrase.R= Size of the character pool:- Numbers only (0-9): Pool size = 10
- Lowercase letters (a-z): Pool size = 26
- Mixed case (a-z, A-Z): Pool size = 52
- Alphanumeric + symbols: Pool size = 95
NIST Special Publication 800-63B Recommendations
NIST recommends prioritizing length over character complexity. A 4-word diceware passphrase (e.g. correct horse battery staple) produces over 77 bits of entropy and is significantly easier for humans to remember while remaining mathematically infeasible for brute-force cracking.