Hacker News new | past | comments | ask | show | jobs | submit login

A stronger KDF would plausibly have protected him even if his password was embarrassingly deterministic.



Maybe. But probably not.

If they were using a crib sheet to the point of only trying 1m attempts, this can be done in “days” with one CPU even if PBKDF2 is set to take one second each attempt on that CPU.

A “better” KDF isn’t fundamentally going to change this. It’s just going to enforce stricter limits on any time-memory trade offs and require more memory. Neither of these are going to be meaningful differences when you’re cracking a single password for a single user with a crib sheet, unless you’re in the realm of billions or more guesses.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: