Large-Order Multiple Recursive Generators with Modulus 231 - 1

The performance of a maximum-period multiple recursive generator (MRG) depends on the choices of the recurrence order k, the prime modulus p, and the multipliers used. For a maximum-period MRG, a large-order k not only means a large period length (i.e., pk-1) but, more importantly, also guarantees the equidistribution property in high dimensions (i.e., up to k dimensions), a desirable feature for a good random-number generator. As to generating efficiency, in addition to the multipliers, some special choices of the prime modulus p can significantly speed up the generation of pseudo-random numbers by replacing the expensive modulo operation with efficient logical operations. To construct efficient maximum-period MRGs of a large order, we consider the prime modulus p = 231-1 and, via extensive computer search, find two large values of k, 7,499 and 20,897, for which pk-1 can be completely factorized. The successful search is achieved with the help of some results in number theory as well as some modern factorization methods. A general class of MRGs is introduced, which includes several existing classes of efficient generators. With the factorization results, we are able to identify via computer search within this class many portable and efficient maximum-period MRGs of order 7,499 or 20,897 with prime modulus 231-1 and multipliers of powers-of-two decomposition. These MRGs all pass the stringent TestU01 test suite empirically.

[1]  Pei-Chi Wu,et al.  Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1 , 1997, TOMS.

[2]  Lih-Yuan Deng,et al.  Issues on Computer Search for Large Order Multiple Recursive Generators , 2008 .

[3]  Pierre L'Ecuyer,et al.  Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators , 1999, Oper. Res..

[4]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[5]  Pierre L'Ecuyer,et al.  Beware of linear congruential generators with multipliers of the form a = ±2q ±2r , 1999, TOMS.

[6]  Fatin Sezgin,et al.  Distribution of Lattice Points , 2006, Computing.

[7]  Lih-Yuan Deng,et al.  A system of high-dimensional, efficient, long-cycle and portable uniform random number generators , 2003, TOMC.

[8]  Lih-Yuan Deng,et al.  Generalized Mersenne Prime Number and Its Application to Random Number Generation , 2004 .

[9]  Pierre L'Ecuyer,et al.  Fast combined multiple recursive generators with multipliers of the form a = ±2q ±2r , 2000, WSC '00.

[10]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[11]  Pierre L'Ecuyer,et al.  A search for good multiple recursive random number generators , 1993, TOMC.

[12]  Pierre L'Ecuyer,et al.  Combined Multiple Recursive Random Number Generators , 1995, Oper. Res..

[13]  J. Pollard.  A monte carlo method for factorization , 1975 .

[14]  Lih-Yuan Deng,et al.  Design and Implementation of Efficient and Portable Multiple Recursive Generators with Few Zero Coefficients , 2008 .

[15]  Pierre L'Ecuyer,et al.  On the Deng-Lin random number generators and related methods , 2004, Stat. Comput..

[16]  Haya Freedman,et al.  Introduction to finite fields and their applications (revised edition) , by Rudolf Lidl and Harald Niederreiter. Pp. 416. £29.95. 1994. ISBN 0-521-46094-8 (Cambridge University Press) , 1995, The Mathematical Gazette.

[17]  Pierre L'Ecuyer,et al.  Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences , 1997, INFORMS J. Comput..

[18]  C. Pomerance,et al.  Prime Numbers: A Computational Perspective , 2002 .

[19]  J. M. Pollard,et al.  Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[21]  L. R. Moore,et al.  An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$ , 1986 .

[22]  H. Riesel.  Prime numbers and computer methods for factorization , 1985 .

[23]  Stephen D. Roberts,et al.  Implementing a portable FORTRAN Uniform (0,1) generator , 1983 .

[24]  H. Riesel.  Prime numbers and computer methods for factorization (2nd ed.) , 1994 .

[25]  I. Damgård,et al.  Average case error estimates for the strong probable prime test , 1993 .

[26]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.

[27]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[28]  P. Kythe,et al.  Tables in Finite Fields , 2012 .

[29]  Rui Guo,et al.  Improving Random Number Generators in the Monte Carlo simulations via twisting and combining , 2008, Comput. Phys. Commun..

[30]  Lih-Yuan Deng,et al.  Scalable parallel multiple recursive generators of large order , 2009, Parallel Comput..

[31]  Lih-Yuan Deng,et al.  Efficient and portable multiple recursive generators of large order , 2005, TOMC.

[32]  P. L'Ecuyer,et al.  Fast combined multiple recursive generators with multipliers of the form a=/spl plusmn/2/sup q//spl plusmn/2/sup r/ , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).