Pseudorandom number generation: Impossibility and compromise

Journal of Universal Computer Science

Volumn 12, Issue 6, 2006, Pages 672-690

  Matsumoto, Makoto ^a   Saito, Mutsuo ^a   Haramoto, Hiroshi ^a   Nishimura, Takuji ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b YAMAGATA UNIVERSITY   (Japan)

Author keywords

Mersenne Twister; Monte Carlo methods; Pseudorandom number generation; Random number generation; Simulation

Indexed keywords

EID: 33746840570     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. [Blum et al. 1986] L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15 (1986), 364-383.
2. [Couture et al. 1993] R. Couture, P. L'Ecuyer, and S. Tezuka, On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences, Math. Comp. 60 (1993), 749-761.
3. [Ferrenberg et al. 1992] Ferrenberg, A. M., Landau, D. P., and Wong, Y. J. (1992) Monte Carlo simulations: hidden errors from 'good' random number generators. Phys. Rev. Lett. 69 3382-3384.
4. [Fredricsson 1975] Fredricsson, S. A. (1975) Pseudo-randomness properties of binary shift register sequences. IEEE Trans. Inform. Theory IT-21, 115-120.
5. [Knuth 1997] Knuth, D. E. The Art of Computer Programming. Vol. 2. Seminumerical Algorithms 3rd Ed. Addison-Wesley, 1997.
6. [L'Ecuyer and Simard] L'Ecuyer, P., and Simard, R,. TestU01 Empirical Testing of Random Number Generators, http://www.iro.umon.treal.ca/~simardr/ indexe.html
7. [Lewis and Payne 1973] Lewis, T. G., and Payne, W. H. Generalized feedback shift register pseudorandom number algorithms. J. ACM 20, 3 (1973), 456-468.
8. [Lindholm 1968] Lindholm, J. H. (1968) An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Trans. Inform. Theory IT-14, 569-576.
9. [Lüscher 1994] Lüscher, M. A portable high-quality random number generator for lattice field theory simulations, Computer Physics Communications, 79 (1994) 100-110.
10. [Marsaglia] Marsaglia, G. http://stat.fsu.edu/pub/dieh.ard/.
11. [Mascagni] Mascagni, M. The Scalable Parallel Random Number Generators Library (SPRNG), http://sprng.cs.fsu.edu/.
12. [Matsumoto] Matsumoto, M. Homepage of Mersenne Twister http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html.
13. [Matsumoto and Kurita, 1992] Matsumoto, M. and Kurita, Y. "Twisted GFSR. Generators," ACM Transactions on Modeling and Computer Simulation 2 (1992), 179-194.
14. [Matsumoto and Kurita, 1994] Matsumoto, M. and Kurita, Y. "Twisted GFSR Generators 11," ACM Transactions on Modeling and Computer Simulation 4 (1994), 254-266.
15. [Matsumoto and Nishimura 1998] Matsumoto, M. and Nishimura, T. "Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator" ACM Trans, on Modeling and Computer Simulation 8 (1998), 3-30.
16. [Matsumoto and Nishimura 2000] Matsumoto, M. and Nishimura, T. "Dynamic Creation of Pseudorandom number generator," 56-69 in: Monte Carlo and Quasi-Monte Carlo Methods 1998, Ed. H. Niederreiter and J. Spanier, Springer 2000. http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/DC/dc.html
17. [Matsumoto and Nishimura 2002] Matsumoto, M. and Nishimura, T. "A Nonempirical Test on the Weight of Pseudorandom Number Generators" 381-395 in: Monte Carlo and Quasi-Monte Carlo methods 2000, Springer-Verlag 2002.
18. [Matsumoto and Nishimura 2003] Matsumoto, M. and Nishimura, T. "Sum-discrepancy test on pseudorandom number generators" Mathematics and Computers in Simulation, Vol. 62 (2003), pp 431-442.
19. [Matsumoto et al. 2006] Matsumoto, M., Wada, I., Kuramoto, A. and Ashihara, H. "Common Defects in Initialization of Pseudorandom Number Generators" submitted.
20. [Niederreiter 1992] Niederreiter, H. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, 1992.
21. [Panneton et al. 2006] Panneton, F., L'Ecuyer, P. and Matsumoto, M. "Improved Long-Period Generators Based on Linear Reccurences Modulo 2" To Appear in ACM Transactions on Mathematical Software.