Interesting, I hadn't seen this before. I find it hard to believe, as Argon2 does psuedorandom access over a large array. As soon as this array gets larger than the local GPU cache (much smaller than CPU cache), we should get pretty good protection. What have I missed?
In particular, in terms of ASIC attacks, bcrypt and other non-memory-hard KDFs have extremely efficient implementations. Silicon is cheap, computation is cheap, memory access is extremely expensive- both in terms of time and power usage.
Re:How To Safely Store A Password (2010)
by IAmLiterallyAB on Thursday December 03, 2020 @08:45AM
(#25288742)
Wow. Never heard that before. Would love a proper article on that.
I wonder how scrypt holds up
Re:How To Safely Store A Password (2010)
by kevinarpe on Thursday December 03, 2020 @10:02PM
(#25298428)
I am not a security expert, but this looks pretty useful: https://security.stackexchange.com/questions/193351/in-2018-...
And that Twitter link (https://twitter.com/TerahashCorp/status/1155129705034653698) leads here: https://www.password-hashing.net/ ... but, on that website, I could not find an explanation about why to use argon2 over bcrypt.
Looks like for the typical case (~200ms calculating the hash) bcrypt beats argon2. I guess that’s what I understand from those discussions, I’m not an expert by any means. It is related with cache hardness: https://twitter.com/Sc00bzT/status/1149963675069026304