Timeline for Making attacks on password hashes less economical
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2018 at 3:12 | history | tweeted | twitter.com/StackCrypto/status/962887226265882624 | ||
| Feb 11, 2018 at 20:36 | vote | accept | ruffsl | ||
| Feb 9, 2018 at 8:10 | answer | added | Geoffroy Couteau | timeline score: 1 | |
| Feb 8, 2018 at 21:26 | comment | added | b degnan | i can get 4GiB on die so the economic questions are a real consideration, but money is a practical solution. do you have a boundary for this? | |
| Feb 8, 2018 at 14:13 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
edited title
|
| Feb 8, 2018 at 4:23 | comment | added | e-sushi | @PaulUszak The word you were looking for is spelled "parallelizable". | |
| Feb 8, 2018 at 3:11 | comment | added | Paul Uszak | Hey, have you seen crypto.stackexchange.com/q/20675. It's not hard to make an algorithm that requires MB or even GB of RAM, can take ages to run and is not paralliseabley (how do you spell it?) | |
| Feb 7, 2018 at 22:53 | history | edited | Ella Rose | CC BY-SA 3.0 |
included comment clarifying the question into the question body
|
| Feb 7, 2018 at 22:39 | review | Close votes | |||
| Feb 8, 2018 at 4:30 | |||||
| Feb 7, 2018 at 21:49 | comment | added | Ella Rose | You don't mention the existence of argon2 or balloon hashing at all, is there some reason those are unsatisfactory? | |
| Feb 7, 2018 at 21:39 | history | asked | ruffsl | CC BY-SA 3.0 |