building a true RNG
Barney Wolff
barney at tp.databus.com
Sun Jul 28 00:30:32 EDT 2002
This leads me to ask what may be a laughably naive question:
Do we even know that the popular hash functions can actually generate
all 2^N values of their outputs?
Amir Herzberg wrote:
> So I ask: is there a definition of this `no wasted entropy` property, which
> hash functions can be assumed to have (and tested for), and which ensures
> the desired extraction of randomness?
--
Barney Wolff
I never met a computer I didn't like.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at wasabisystems.com
More information about the cryptography
mailing list