3 ms·
What's the Big-O of PBKDF2 ? Constants matter. (Also, computational complexity of crypto algorithms is usually specified in terms of nbits, not numeric magnit
by mindslight 14y ago
What's the Big-O of PBKDF2 ?
Constants matter.
(Also, computational complexity of crypto algorithms is usually specified in terms of nbits, not numeric magnitude)
(Although this argument has given me an idea for everyone that thinks using the same password on different sites is reasonable - a browser extension that runs a client-side KDF :P)