Proving the randomness of a random number generator?

[Pat Farrell]

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 at metzdowd.com