2 ms·
For x << 2^(N/2) and a random oracle H which produces an N-bit output, H^x has approximately N - log(x) bits of entropy. So it is a real issue, but not one whi
by cperciva 13y ago
For x << 2^(N/2) and a random oracle H which produces an N-bit output, H^x has approximately N - log(x) bits of entropy.
So it is a real issue, but not one which is serious enough to matter in practice. This is, however, why we use PBKDF2 instead of PBKDF1.