Random bits (generation)

*To*: mathgroup at smc.vnet.net*Subject*: [mg35045] Random bits (generation)*From*: "DIAMOND Mark R." <dot at dot.dot>*Date*: Thu, 20 Jun 2002 23:54:45 -0400 (EDT)*Organization*: The University of Western Australia*Sender*: owner-wri-mathgroup at wolfram.com

I am not sure whether anyone other than a Wolfram guru will know the answer to this. ... (1) If I wish to generate a large number of random bits, what is the fastest way? (2) What is the safest way in the sense of being able to expect the bit sequence to pass Marsaglia's Diehard battery of tests Maurer's Universal Statistical Test.? or is this requirement impossible to meet with Random? More specifically, to be sure that they are independent and random, should I use something like Random[Integer, {0,1}] or can one use *all the bits* of, say, Random[Integer, {0,2^32-1}] ... or even something larger. Cheers, Mark Diamond

**Follow-Ups**:**Re: Random bits (generation)***From:*Daniel Lichtblau <danl@wolfram.com>