A fast uniform astronomical random number generator

The present method generates machine-independent uniform random sequences of real numbers in the interval (0.,1.) excluding 1. It uses a set of up to 1024 independent multiplicative congruential generators working with:• modulii which are chosen prime numbers whose values have been fixed according to the positive 31-bit positive integer arithmetic available and in the form of 2.P'+1, where P's are also primes.• multipliers which are selected from one of their corresponding primitive elements as multipliers to achieve each full cycle independently.The "astronomical" maximum periodicity can be considered as infinite: O (106021); it can be adjusted if required by the user in the sequential version RAN01 or statistically reaching the maximum in the improved "stagger" version DAN01.An "acceptable" composite period is estimated to be O (10189) for a set of only 32 of such independent generators: this fact could find a nice application in the realization of efficient hash-functions in smart cards.An implementation in structured FORTRAN 77 shows very good results in terms of statistical proprieties, velocity and periodicity.

[1]  M. Kendall,et al.  Tables Of Random Sampling Numbers , 1946 .

[2]  Daniel Guinier.  A fast and portable uniform quasi-random generator of very large period based ona generalized multi-moduli congruential method , 1988, SIML.

[3]  P. A. W. Lewis,et al.  A Pseudo-Random Number Generator for the System/360 , 1969, IBM Syst. J..

[4]  Pierre L'Ecuyer,et al.  Efficient and portable combined random number generators , 1988, CACM.

[5]  R. G. T. Grafton.  The Runs‐Up and Runs‐Down Tests , 1981 .

[6]  W. H. Payne,et al.  Coding the Lehmer pseudo-random number generator , 1969, CACM.

[7]  K. Senne.  Machine independent monte carlo evaluation of the performance of dynamic stochastic systems , 1975 .

[8]  R. D. Carmichael.  Note on a new number theory function , 1910 .

[9]  J. D. Beasley,et al.  Algorithm AS 111: The Percentage Points of the Normal Distribution , 1977 .

[10]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[11]  J. Scherpenisse,et al.  A pseudo random number generator , 1974 .

[12]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[13]  Adi Shamir,et al.  On the Generation of Cryptographically Strong Pseudo-Random Sequences , 1981, ICALP.

[14]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[15]  R. R. Coveyou,et al.  Fourier Analysis of Uniform Random Number Generators , 1967, JACM.

[16]  Joseph B. Kruskal,et al.  Extremely portable random number generator , 1969, CACM.

[17]  I. D. Hill,et al.  Correction: Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator , 1982 .

[18]  Herbert S. Bright,et al.  Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography , 1979, CSUR.