Timeline for How to securely hash passwords?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:17 | review | Late answers | |||
| Sep 29, 2015 at 19:55 | |||||
| Oct 31, 2014 at 17:52 | review | Low quality posts | |||
| Oct 31, 2014 at 23:27 | |||||
| Sep 6, 2013 at 10:51 | comment | added | CodesInChaos | I'd wait until the end of the password hashing competition and only then choose a scheme that does well in the competition. Until then bcrypt or scrypt is preferable. If catena is really as good as it claims, it will be a strong contender. But unfortunately I don't think it is. | |
| Sep 6, 2013 at 10:50 | comment | added | CodesInChaos | 1) It's been known for a long time that a straight forward implementation of scrypt is potentially vulnerable to timing attacks. 2) I don't believe in catena's security claims yet. I believe it's vulnerable to an attack with complexity t^1.5 and thus doesn't reach the claimed t^2 security. 3) I believe it's a more promising route to create implementations of scrypt(or similar constructions) that mask the memory access pattern than using predictable memory access like in catena. | |
| Sep 6, 2013 at 10:22 | history | answered | lkk | CC BY-SA 3.0 |