[144388] in cryptography@c2.net mail archive
Re: CSPRNG algorithms
daemon@ATHENA.MIT.EDU (John Levine)
Fri May 1 15:29:33 2009
Date: 1 May 2009 09:54:54 -0000
From: John Levine <johnl@iecc.com>
To: cryptography@metzdowd.com
In-Reply-To: <20090313191615.GC15102@subspacefield.org>
Cc: travis+ml-cryptography@subspacefield.org
>I have never seen a good catalog of computationally-strong
>pseudo-random number generators.
Chapter 3 of Knuth's TAOCP is all about pseudo-random number
generators, starting with a fine example of the wrong way to do it.
My copy is several thousand miles away but my recollection is that his
main advice was to stick to linear congruential PRNGs, perhaps with a
buffered postpass to scramble up the order or the results.
It's certainly a good place to start.
R's,
John
[Moderator's note: none of the generators in TAOCP are cryptographically
strong. They are fine for Monte Carlo simulations and such. --Perry]
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
