Timeline for Does the Balloon hashing paper deprecate Argon2?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2018 at 23:24 | answer | added | yanofearth | timeline score: 1 | |
| Mar 20, 2017 at 18:35 | history | edited | Jeremy Banks |
edited tags
|
|
| Sep 16, 2016 at 6:38 | vote | accept | rmalayter | ||
| Sep 15, 2016 at 13:01 | answer | added | SEJPM | timeline score: 19 | |
| Sep 15, 2016 at 12:54 | history | tweeted | twitter.com/StackCrypto/status/776403829390766080 | ||
| Sep 15, 2016 at 12:10 | comment | added | SEJPM | IIRC this was discussed on the PHC mailing list a while ago and they said that you can't get really good time-memory trade-off penalties with the data-independent Argon2i. If you can (and don't mind theoretical cache-timing attacks) use Argon2d which is safe against these attacks (because it's data-dependent). | |
| S Sep 15, 2016 at 10:57 | history | suggested | ilkkachu | CC BY-SA 3.0 |
fix spelling of Balloon
|
| Sep 15, 2016 at 10:42 | comment | added | CodesInChaos | I would go with bcrypt or scrypt instead of those new algorithms for now. | |
| Sep 15, 2016 at 8:39 | review | Suggested edits | |||
| S Sep 15, 2016 at 10:57 | |||||
| Sep 15, 2016 at 8:10 | comment | added | Luis Casillas | I suggest that answers to this question might also want to address Alwen & Blocki's recent papers: "Efficiently Computing Data-Independent Memory-Hard Functions" and "Towards Practical Attacks on Argon2i and Balloon Hashing". | |
| Sep 15, 2016 at 5:53 | history | edited | rmalayter |
edited tags
|
|
| Sep 15, 2016 at 5:42 | history | edited | rmalayter | CC BY-SA 3.0 |
added 17 characters in body
|
| Sep 15, 2016 at 5:35 | history | asked | rmalayter | CC BY-SA 3.0 |