Generating Uniform Random Numbers
Integers uniformly distributed over some interval are at the heart of pseudorandom number generators. This chapter examines techniques for generating pseudorandom integers: some historical, some useful for noncritical tasks such as games, and others which are workhorses and should be thought of as go-to methods. We will also take a look at how combining generators can increase their periods. We end the chapter with a brief look at quasirandom generators.
- 1.Lehmer, D. H. “Proceedings of the Second Symposium on Large-Scale Digital Computing Machinery.” (1951).Google Scholar
- 3.Knuth, Donald Ervin. The art of computer programming: sorting and searching. Vol. 3. Pearson Education, 1998.Google Scholar
- 8.Shannon, Claude E. “Programming a computer for playing chess.” The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 41.314 (1950): 256–275.Google Scholar
- 11.Saito, Mutsuo, and Makoto Matsumoto. “Simd-oriented fast mersenne twister: a 128-bit pseudorandom number generator.” Monte Carlo and Quasi-Monte Carlo Methods 2006. Springer, Berlin, Heidelberg, 2008. 607–622.Google Scholar
- 13.http://xoroshiro.di.unimi.it/ (accessed 20-Aug-2017).
- 14.Vigna, Sebastiano. “An experimental exploration of Marsaglia’s xorshift generators, scrambled.” ACM Transactions on Mathematical Software (TOMS) 42.4 (2016): 30.Google Scholar
- 15.Kneusel, Ronald T. Numbers and Computers, 2nd Ed. Springer International Publishing, 2017.Google Scholar
- 16.Marsaglia, George (2003) “Random Number Generators,” Journal of Modern Applied Statistical Methods: Vol. 2 : Iss. 1, Article 2.Google Scholar
- 17.http://school.anhb.uwa.edu.au/personalpages/kwessen/shared/Marsaglia03.html (accessed 27-Aug-2017).
- 18.Salmon, John K., Mark A. Moraes, Ron O. Dror, and David E. Shaw. “Parallel random numbers: as easy as 1, 2, 3.” In High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for, pp. 1–12. IEEE, 2011.Google Scholar
- 20.Marsaglia, George (2011) “RNGs with periods exceeding 10(̂40million).” Online posting 16-Jan-2011, sci.crypt.Google Scholar
- 21.Rose, Gregory G. “KISS: A bit too simple.” Cryptography and Communications (2011): 1–15.Google Scholar