Common defects in initialization of pseudorandom number generators

ACM Transactions on Modeling and Computer Simulation

Volumn 17, Issue 4, 2007, Pages

  Matsumoto, Makoto ^a   Wada, Isaku ^b,c   Kuramoto, Ai ^c   Ashihara, Hyo ^c  

^a HIROSHIMA UNIVERSITY   (Japan)

^b Tempstaff Technologies

^c KUMAMOTO UNIVERSITY   (Japan)

Author keywords

Difference collision; Interstream correlation; Monte Carlo simulation; Nearly affine dependence; Pseudorandom number generator

Indexed keywords

LINEAR SYSTEMS; MONTE CARLO METHODS; RECURSIVE FUNCTIONS;

DIFFERENCE COLLISION; INTERSTREAM CORRELATION; NEARLY AFFINE DEPENDENCE; PSEUDORANDOM NUMBER GENERATOR;

RANDOM NUMBER GENERATION;

EID: 34648834264     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/1276927.1276928     Document Type: Article

References (17)

1. BIHAM, E. AND SHAMIR, A. 1991. Differential cryptanalysis of DES-like cryptosystems. J. Cryptal. 4, 1, 3-72.
2. GNU. 2004. GNU scientific library version 1.6. http://www.gnu.org/ software/gsl.
3. JAMES, F. 1994. Ranlux: A fortran implementation of the high-quality pseudorandom number generator of Lüscher. Comput. Phys. Commun. 79, 1 (Feb.), 111-114.
4. KNUTH, D. E. 1997. The Art of Computer Programming, vol. 2. Seminumerical Algorithms, 3rd ed. Addison-Wesley, Reading, MA.
5. L'ECUYEH, P. 1996. Combined multiple recursive random number generators. Oper. Res. 44, 5, 816-822.
6. L'ECUYER, P. 1992. Testing random number generators. In Proceedings of the IEEE Winter Simulation Conference (Arlington VA). 305-313.
7. L'ECUYER, P. 1993. A search for good multiple recursive random number genarators. ACM Trans. Model.Comput. Simul. 3, 2 (Apr.), 87-98.
8. L'ECUYER, P., SIMARD, R., CHEN, E. J., AND KELTON, W. D. 2002. An object-oriented random number package with many long streams and substreams. Oper. Res. 50, 6, 1073-1075.
9. L'ECUYER, P. AND ANDRES, T. H. 1997. A random number generator based on the combination of four LCGs. Math. Comput. Simul. 44, 44, 99-107.
10. LÜSCHER, M. 1994. A portable high-quality random number generator for lattice field theory simulations. Comput. Phys. Commun. 79, 1 (Feb.), 100-110.
11. MASCAGNI, M. AND SRINIVASAN, A. 2004. Parameterizing parallel multiplicative lagged-Fibonacci generators. Parallel Comput. 30, 7 (Jul.), 899-916.
12. MASCAGNI, M. AND SRINIVASAN, A. 2000. Algorithm 806: SPRNG: A scalable library for pseudorandom number generation. ACM Trans. Math. Softw. 26, 3, 436-461. http://sprng.cs.fsu.edu/.
13. MATSUI, M. 1994. Linear cryptanalysis method for DES cipher. InProceedings of the International Workshop on Theory and Applications Advances in Cryptology (EuroCrypt) (Lofthus, Norway). Lecture Notes in Computer Science, 765. Springer. 386-397.
14. MATSUMOTO, M. AND NISHIMURA, T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. Model. Comput. Simul. 8, 1 (Jan.), 3-30.
15. MATSUMOTO, M. AND NISHIMURA, T. 2003. Sum-Discrepancy test on pseudorandom number generators. Math. Comput. Simul. 62, 3-61, 431-442.
16. MATSUMOTO, M. AND NISHIMURA, T. 2000. The dynamic creation of pseudorandom number generators. In Monte Carlo and Quasi-Monte Carlo Methods. Springer, 56-69.
17. TEZUKA, S., L'ECUYER, P., AND COUTURE, R. 1994. On the add-with-carry and subtract-with-borrow random number generators. ACM Trans. Model. Comput. Simul. 3, 4, 315-331.