This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
October 2000 (vol. 49 no. 10)
pp. 1146-1151

Abstract—Finding good random number generators (RNGs) is a hard problem that is of crucial import in several fields, ranging from large-scale statistical physics simulations to hardware self-test. In this paper, we employ the cellular programming evolutionary algorithm to automatically generate two-dimensional cellular automata (CA) RNGs. Applying an extensive suite of randomness tests to the evolved CAs, we demonstrate that they rapidly produce high-quality random-number sequences. Moreover, based on observations of the evolved CAs, we are able to handcraft even better RNGs, which not only outperform previously demonstrated high-quality RNGs, but can be potentially tailored to satisfy given hardware constraints.

[1] P.P. Chaudhuri, D.R. Chowdhury, S. Nandi, and S. Chattopadhyay, Additive Cellular Automata: Theory and Applications, vol. 1.Los Alamitos, Calif.: IEEE CS Press, 1997.
[2] S. Nandi, B.K. Kar, and P. Pal Chaudhuri, "Theory and Application of Cellular Automata in Cryptography," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,346-1,357, Dec. 1994.
[3] P.D. Hortensius et al., "Cellular Automata Based Pseudo-Random Number Generators for Built-In Self-Test," IEEE Trans. Computer-Aided Design, vol. 8, pp. 842-859, Aug. 1989.
[4] P.D. Hortensius, R.D. McLeod, and H.C. Card, Parallel Random Number Generation for VLSI Systems using Cellular Automata IEEE Trans. Computers, vol. 38, no. 10, pp. 1466-1473, Oct. 1989.
[5] Ph. Tsalides, T.A. York, and A. Thanailakis, "Pseudorandom Number Generators for Systems Based on Linear Cellular Automata," IEE Proc. Part E: Computers and Digital Techniques, vol. 138, pp. 241-249, 1991.
[6] K. Cattel, S. Zhang, M. Serra, and J.C. Muzio, “2-by-nHybrid Cellular Automata with Regular Configuration: Theory and Application,” IEEE Trans. Computers, vol. 48, no. 3, pp. 285-295, Mar. 1999.
[7] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, third ed. Heiderberg: Springer-Verlag, 1996.
[8] M. Mitchell, An Introduction to Genetic Algorithms. MIT Press, 1996.
[9] M. Sipper and M. Tomassini, “Generating Parallel Random Number Generators by Cellular Programming,” Int'l J. Modern Physics C, vol. 7, no. 2, pp. 181-190, 1996.
[10] M. Tomassini, M. Sipper, M. Zolla, and M. Perrenoud, “Generating High-Quality Random Numbers in Parallel by Cellular Automata,” Future Generation Computer Systems, vol. 16, pp. 291-305, 1999.
[11] D.R. Chowdhury, I. Sengupta, and P.P. Chaudhuri, “A Class of Two-Dimensional Cellular Automata and Their Applications in Random Pattern Testing,” J. Electronic Testing: Theory and Applications, Vol. 5, No. 1, Feb. 1994, pp. 67-82.
[12] M. Sipper, Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Heidelberg: Springer-Verlag, 1997.
[13] M. Sipper, “The Emergence of Cellular Computing,” Computer, vol. 32, no. 7, pp. 18-26, July 1999.
[14] G. Marsaglia, “Diehard,” http://stat.fsu.edu/~geodiehard.html, 1998.
[15] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[16] A. Wuensche and M. Lesser, The Global Dynamics of Cellular Automata: An Atlas of Basin of Attraction Fields of One-dimensional Cellular Automata. Santa Fe Inst. for Studies in the Sciences of Complexity, Reading, Mass.: Addison-Wesley, 1992.

Index Terms:
Cellular automata, random number generators, evolutionary algorithms.
Citation:
Marco Tomassini, Moshe Sipper, Mathieu Perrenoud, "On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata," IEEE Transactions on Computers, vol. 49, no. 10, pp. 1146-1151, Oct. 2000, doi:10.1109/12.888056
Usage of this product signifies your acceptance of the Terms of Use.