[11234] in cryptography@c2.net mail archive
Re: building a true RNG
daemon@ATHENA.MIT.EDU (David Wagner)
Mon Jul 29 11:58:29 2002
X-Envelope-To: cryptography@wasabisystems.com
To: cryptography@wasabisystems.com
From: daw@mozart.cs.berkeley.edu (David Wagner)
Date: 29 Jul 2002 15:39:32 GMT
X-Complaints-To: news@abraham.cs.berkeley.edu
Barney Wolff wrote:
>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?
It seems very unlikely that they can generate all 2^N outputs
(under current knowledge). However, they satisfy the next-best
thing: their output appears to be indistinguishable from uniform to
computationally-bounded observers, hence it's "as good as" if they
could generate all 2^N outputs for most purposes.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
