Random number generator tested:

taus
Minimum value: 0
Maximum value: 4294967295
Random number generator algorithms:
This is a maximally equidistributed combined Tausworthe generator by L'Ecuyer. The sequence is,
xn = (s1n ^ s2n ^ s3n)
where,

s1n+1 = (((s1n&4294967294)<<12)^^(((s1n<<13)^^s1n)>>19))
s2n+1 = (((s2n&4294967288)<< 4)^^(((s2n<< 2)^^s2n)>>25))
s3n+1 = (((s3n&4294967280)<<17)^^(((s3n<< 3)^^s3n)>>11))

computed modulo 232. In the formulas above ^^ denotes "exclusive-or". Note that the algorithm relies on the properties of 32-bit unsigned integers and has been implemented using a bit mask of 0xFFFFFFFF to make it work on 64 bit machines.

The period of this generator is 288 (about 1026). It uses 3 words of state per generator. For more information see,

P. L'Ecuyer, "Maximally Equidistributed Combined Tausworthe Generators", Mathematics of Computation, 65, 213 (1996), 203--213.

Pierre L'Ecuyer's publications can be found in http://www.iro.umontreal.ca/~lecuyer/papers.html