Is there a loss of entropy by hashing an N-bit random key to produce an N-bit hash?
I read the following piece of code:
dd if=/dev/urandom bs=16 count=1 2>/dev/null | md5sum
Apparently, this code was used as a trick to produce a hex string key from a 128-bit binary pseudo-random value.
Someone here cl… Continue reading Is there a loss of entropy by hashing an N-bit random key to produce an N-bit hash?