Generating pseudo-random numbers by combining two systems with complex behaviors

Cellular automata (CA) due to its complex behavior has several applications such as generating random numbers and cryptography. Because of the intrinsic self-organized property, a pure CA cannot produce a long sequence of random numbers. Non-uniform, controllable/programmable CA or a combination of several automata can be used to increase the length of a produced sequence of random numbers. In this paper, a non-uniform CA as a random number generator has been combined with Langton's ants in order to generate random numbers. Langton's ant is a simple discrete dynamical system, with a surprisingly complex behavior. The combination of some Langton's ants gives them a chaotic behavior and combination of this behavior with complex behavior of cellular automata causes a great efficiency in generating random sequences. Experimental results show that, results given by the combination of ants and CA does not depend on initial value and shows a random behavior, resulting in cycles with very long period lengths and a limited number of cells such that a cycle length of 2^3^n is obtained by n cells. Moreover, some tests such as entropy, avalanche, diehard, NIST and several basic statistical tests have been performed and all of them have been successfully passed.

[1]  Rong Wang,et al.  Data Encryption Based on Multi-granularity Reversible Cellular Automata , 2009, 2009 International Conference on Computational Intelligence and Security.

[2]  Marco Tomassini,et al.  Cryptography with cellular automata , 2001, Appl. Soft Comput..

[3]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.

[4]  Petre Anghelescu.  Encryption algorithm using Programmable Cellular Automata , 2011, 2011 World Congress on Internet Security (WorldCIS-2011).

[5]  Pierre L'Ecuyer,et al.  Random numbers for simulation , 1990, CACM.

[6]  Khaled Elleithy,et al.  Novel Algorithms and Techniques In Telecommunications, Automation and Industrial Electronics , 2008 .

[7]  Ioannis Andreadis,et al.  Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators , 1997, Microprocess. Microsystems.

[8]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[9]  Howard C. Card,et al.  Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Pierre L'Ecuyer,et al.  Efficient and portable combined Tausworthe random number generators , 1990, TOMC.

[11]  Dong-Ho Lee,et al.  Pseudorandom Number Generation Using Cellular Automata , 2008 .

[12]  Andrea Reese,et al.  Random number generators in genetic algorithms for unconstrained and constrained optimization , 2009 .

[13]  Wang Ding,et al.  Generating High-Quality Random Numbers by Cellular Automata with PSO , 2008, 2008 Fourth International Conference on Natural Computation.

[14]  Kee-Young Yoo,et al.  A Virtual Three-Dimension Cellular Automata Pseudorandom Number Generator Based on the Moore Neighborhood Method , 2008, ICIC.

[15]  Steven Guan,et al.  An evolutionary approach to the design of controllable cellular automata structure for random number generation , 2003, IEEE Trans. Evol. Comput..

[16]  Behrouz A. Forouzan,et al.  Cryptography and network security , 1998 .

[17]  Dong-Ho Lee,et al.  High-Performance Pseudorandom Number Generator Using Two-Dimensional Cellular Automata , 2008, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008).

[18]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[19]  William H. Press,et al.  Numerical recipes in C , 2002 .

[20]  E. Sofron,et al.  Programmable cellular automata based encryption algorithm , 2008, 2008 International Semiconductor Conference.

[21]  Brad C. Johnson.  Radix-b extensions to some common empirical tests for pseudorandom number generators , 1996, TOMC.

[22]  William H. Press,et al.  Numerical Recipes in C, 2nd Edition , 1992 .

[23]  Albert Y. Zomaya,et al.  Cellular automata computations and secret key cryptography , 2004, Parallel Comput..

[24]  Kee-Young Yoo,et al.  Analysis of 2-State, 3-Neighborhood Cellular Automata Rules for Cryptographic Pseudorandom Number Generation , 2009, 2009 International Conference on Computational Science and Engineering.

[25]  Marco Tomassini,et al.  Generating high-quality random numbers in parallel by cellular automata , 1999, Future Gener. Comput. Syst..

[26]  Parimal Pal Chaudhuri,et al.  Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[27]  Parimal Pal Chaudhuri,et al.  A class of two-dimensional cellular automata and their applications in random pattern testing , 1994, J. Electron. Test..

[28]  Mark M. Meysenburg,et al.  Randomness and GA performance, revisited , 1999 .

[29]  Hideki Imai,et al.  A Family of Fast Keystream Generators Based on Programmable Linear Cellular Automata over GF(q) and Time-Variant Table (Special Section on Cryptography and Information Security) , 1999 .

[30]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[31]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[32]  Marco Tomassini,et al.  On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata , 2000, IEEE Trans. Computers.

[33]  Craig B. Borkowf,et al.  Random Number Generation and Monte Carlo Methods , 2000, Technometrics.

[34]  Makoto Matsumoto,et al.  Twisted GFSR generators , 1992, TOMC.

[35]  Radu Dogaru,et al.  Binary Chaos Synchronization in Elementary Cellular Automata , 2009, Int. J. Bifurc. Chaos.

[36]  Sheng-Uei Guan,et al.  A FAMILY OF CONTROLLABLE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION , 2002 .

[37]  Howard C. Card,et al.  Parallel Random Number Generation for VLSI Systems Using Cellular Automata , 1989, IEEE Trans. Computers.

[38]  Carmelo J. A. Bastos Filho,et al.  Impact of the quality of random numbers generators on the performance of particle swarm optimization , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[39]  P. Bouvry,et al.  Evolving collective behavior of cellular automata for cryptography , 2006, MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference.

[40]  Petre Anghelescu,et al.  FPGA Implementation of Hybrid Additive Programmable Cellular Automata Encryption Algorithm , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[41]  Parimal Pal Chaudhuri,et al.  Additive Cellular Automata Theory and Applications Volume I , 1997 .

[42]  Li Yuan-xiang.  Data encryption based on multi-granularity reversible cellular automata , 2010 .