Random number generator tested:

ranlux389
Minimum value: 0
Maximum value: 16777215
Random number generator algorithms:
This is a lagged fibonacci generator with skipping developed by Luescher. The sequence is a series of 24-bit integers,
xn = dn + bn
where dn = xn-10 - xn-24 - cn-1, bn = 0 if dn >= 0 and bn = 224 if dn < 0, cn = 0 if dn >= 0 and cn = 1 if dn < 0, where after 24 samples a group of p(=365) integers are "skipped", to reduce correlations.

The period of the generator is around 10171.

From: M. Luescher, "A portable high-quality random number generator for lattice field theory calculations", Computer Physics Communications, 79 (1994) 100-110.
Available on the net as hep-lat/9309020 at http://xxx.lanl.gov/

See also, F. James, "RANLUX: A Fortran implementation of the high-quality pseudo-random number generator of Luscher", Computer Physics Communications, 79 (1994) 111-114 Kenneth G. Hamilton, F. James, "Acceleration of RANLUX", Computer Physics Communications, 101 (1997) 241-248 Kenneth G. Hamilton, "Assembler RANLUX for PCs", Computer Physics Communications, 101 (1997) 249-253