[11225] in cryptography@c2.net mail archive
Re: building a true RNG
daemon@ATHENA.MIT.EDU (Barney Wolff)
Mon Jul 29 10:47:40 2002
Date: Sun, 28 Jul 2002 00:30:32 -0400
From: Barney Wolff <barney@tp.databus.com>
To: cryptography@wasabisystems.com
In-Reply-To: <3D42E8CA.C44013A2@monmouth.com>
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@wasabisystems.com
