At Wed, 19 Jul 2006 18:47:41 -0400 (EDT), Robert G. Brown wrote: > a) Are there any plans to put a BBS (Blum-Blum-Shub) RNG into the GSL? > It is supposedly slow but cryptographically strong and I'd like to > verify that in dieharder as I start to work on the crypto tests from > STS. If I write one in a standard GSL wrapper, will you add it?
Hello, If you have any extension routines you want to make available I can list them on the main GSL web page at www.gnu.org pointing to your site. I did not include any cryptographic generators as they typically require a multiple-precision integer package. Also they are usually really slow. Re seeding, a good generator ought to work equally well for any seed, so choosing random seeds should not be any different from choosing seeds of 1, 2, 3, .... . A one bit difference in the seed ought to produce an uncorrelated sequence. If not, the generator is at fault. Maybe the effects of seeding could be tested in dieharder? e.g repeatedly pick sets of seeds s, s+1 and test the interleaved sequences u0,v0,u1,v1,... using some of the standard tests. Possibly you already do this, I only tried out some of the tests. -- Brian Gough
