Random-walk pseudorandom byte generator

Applied Mathematical Modelling

Volumn 24, Issue 10, 2000, Pages 771-778

  Dahl, D A ^a   Atwood, C L ^a   LaViolette, R A ^a  

^a IDAHO NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MONTE CARLO METHODS;

PSEUDORANDOM BYTE GENERATORS;

RANDOM NUMBER GENERATION;

EID: 0034250331     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0307-904X(00)00023-8     Document Type: Article

References (17)

1. I. Vattulainen, T. Ala-Nissila, K. Kankaala, Physical models as tests of randomness, Phys. Rev. E 52 (1995) 3205. The related code is available at http://www.netlib.org/
2. A.M. Ferrenberg D.P. Landau Y.J. Wong Monte Carlo simulations: hidden errors from good random number generators Phys. Rev. Lett. 69 1992 3382
3. F. Schmid N.B. Wilding Errors in Monte Carlo simulations using shift register random number generators Int. J. Mod. Phys. C 6 1995 781
4. A. Heuer B. Dunweg A.M. Ferrenberg Considerations on correlations in shift-register pseudorandom number generators and their removal Comput. Phys. Commun. 103 1997 1
5. R.M. Ziff Four-tap shift-register-sequence random-number generators Comput. Phys. 12 1998 385
6. G.S. Fishman L.R. Moore A statistical evaluation of multiplicative congruential random number generators with modulus 231-1 J. Am. Statist. Assoc. 77 1982 129
7. W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vetterling, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, Cambridge, UK, 1986 (Ch. 7)
8. Although the terms addresses or pointers would be more natural here, those terms have become so absorbed by programming practice that we resort to the term “dials” for its freedom from overlap with other terminology
9. In order to specify the initial conditions one must specify both the seed and the 216 bytes employed in the tables, which would be prohibitive to list here. We typically chose the byte “h” for the “seed” of the runs employed here
10. J. Walker, ent , private communication, 1994. The code and documentation is available at http://www.fourmilab.ch/random/
11. R.W. Hamming, Coding and Information Theory, Prentice-Hall, Englewood Cliffs, NJ, 1980, pp. 104–108
12. D.E. Knuth, The Art of Computer Programming Volume 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1969, pp. 35–40
13. J.M. Hammersly, D.C. Handscomb, Monte Carlo Methods, Chapman & Hall, London, 1964 (Ch. 3)
14. R.W. Hamming, Coding and Information Theory, Prentice-Hall, Englewood Cliffs, NJ, 1980, pp. 64, 65
15. G. Marsaglia, diehard (FSU Department of Statistics, CDROM 1995). Available at http://stat.fsu.edu/∼geo/
16. The fact the average minimum distance recorded was about 50% larger than the expected mean, while the expected values in all of the other tests are close to those values generated by rawkrab , suggests that this test, and only this test, contained an undetected error in our implementation
17. SAS, Version 8, SAS Institute, Cary, NC, USA, 1999