[144421] in cryptography@c2.net mail archive
Re: CSPRNG algorithms
daemon@ATHENA.MIT.EDU (Peter Gutmann)
Wed May 6 09:53:15 2009
From: Peter Gutmann <pgut001@cs.auckland.ac.nz>
To: cryptography@metzdowd.com,
travis+ml-cryptography@subspacefield.org
In-Reply-To: <20090313191615.GC15102@subspacefield.org>
Date: Thu, 07 May 2009 01:16:49 +1200
Travis <travis+ml-cryptography@subspacefield.org> writes:
>I have never seen a good catalog of computationally-strong pseudo-random
>number generators. It seems that everyone tries to roll their own in
>whatever application they are using, and I bet there's a lot of waste and
>inefficiency and re-inventing the wheel involved.
>
>If this true, or is there a survey somewhere?
I did a (hopefully) reasonably comprehensive analysis of what was around in
the late 90s in my thesis, available via
http://researchspace.auckland.ac.nz/handle/2292/2310 (there's an updated
version available as "Cryptographic security architecture: design and
verification", published by Springer), specifically chapter 6, "Random number
generation". This covers PRNGs from AC2, X9.17, PGP 5.x, /dev/random, Skip,
ssh (that is, the ssh.com implementation), SSLeay/OpenSSL, CryptoAPI,
Capstone/Fortezza, the Intel PIII generator, and some other bits.
Peter.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
