Mathematical Foundation
Password Entropy Calculator
Shannon entropy is the scientific measurement of password unpredictability. It quantifies how many binary bits of true randomness are contained within a secret.
The PassCheck Entropy Equation
E = L × log₂(N)
Where L is the password length and N is the number of possible characters in the character pool.
Entropy Strength Benchmarks
< 28 Bits (Very Weak)
Can be cracked instantaneously by any basic GPU hash script or online dictionary attack.
28 - 50 Bits (Moderate)
Resistant to basic online attacks, but vulnerable to offline GPU attacks if a hash is leaked.
50 - 75 Bits (Strong)
Takes decades of supercomputing effort to brute-force offline, suitable for critical user accounts.
> 75 Bits (Cryptographic)
Search space exceeds hundreds of billions of years across all existing hardware clusters.