Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Well it's hard to state what exact n is here, but you'd probably be increasing both the calculation time and memory requirements at 2^n, so you need roughly 1/k of an entire computer to calculate even as Moore's law marches on and factors increase, but PBKDF2 parallelizes more and more.


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

Search: