Timeline for What would typically be considered an acceptable string entropy for passwords?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2015 at 13:29 | vote | accept | scniro | ||
| Oct 23, 2015 at 8:36 | answer | added | SilverlightFox | timeline score: 1 | |
| Oct 23, 2015 at 6:20 | comment | added | Freedo | My KeePass password are usually 200+ bits of entropy... | |
| Oct 23, 2015 at 5:16 | answer | added | Soron | timeline score: 4 | |
| Oct 23, 2015 at 4:50 | comment | added | Soron | Per-character Shannon entropy is going to be a very poor measure of password complexity. Using the same algorithm, I get an entropy of 2.75 bits per character for "password", or a total entropy of 22 bits. That implies that it would take 2^22 = 4194304 guesses to crack; in reality, the number of guesses for "password" will usually be in the low single digits. | |
| Oct 23, 2015 at 4:43 | review | First posts | |||
| Oct 23, 2015 at 5:19 | |||||
| Oct 23, 2015 at 4:39 | history | asked | scniro | CC BY-SA 3.0 |