Re:Cryptographic Right Answers
by Dylan16807 on Saturday May 23, 2015 @09:34PM
(#9595035)
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.
[ Parent
| on HN ]
There are no comments on this comment yet.