[19070] in cryptography@c2.net mail archive
Re: Proving the randomness of a random number generator?
daemon@ATHENA.MIT.EDU (Pat Farrell)
Sat Dec 3 13:49:52 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
From: Pat Farrell <pfarrell@pfarrell.com>
Reply-To: pfarrell@pfarrell.com
To: cryptography@metzdowd.com
In-Reply-To: <20051202105403.GB9710@blackfell.bogus.net>
Date: Fri, 02 Dec 2005 12:53:03 -0500
On Fri, 2005-12-02 at 11:54 +0100, Lee Parkes wrote:
> So, the question is, how can the randomness of a PRNG be proved within
> reasonable limits of time, processing availability and skill?
Cryptographic randomness? None.
Any one who considers arithmetical methods of producing random digits
is, of course, in a state of sin.
John von Neumann, 1951, quoted by Knuth
Depending on the language you are using, it is as simple as calling
the appropriate random number generator.
Of have someone read Knuth's Art of Computer Programming
for background on it.
--
Pat Farrell
http://www.pfarrell.com
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
