Generating High-Quality Random Numbers by Next Nearest-Neighbor Cellular Automata

Cellular automaton (CA) has been widely investigated as random number generators (RNGs). However, the CA rule and the number of neighbors must be chosen carefully for good randomness. In Ref. [11], non-uniform CA with next nearest neighborhood was applied to generate a pseudo-random sequence. Considering that non-uniform CA has more complex implementation in hardware and needs lager memory to store different rules than uniform CA. In this paper, we propose new RNGs based on uniform CA with next nearest neighborhood. Time spacing technique and NIST statistical test suite are used to find optimal rules for uniform CA. Experiment results show that the sequences generated by uniform CA with optimal rules successfully passed all tests in the NIST suite.

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

[2]  P. Bouvry,et al.  Collective Behavior of Rules for Cellular Automata-based Stream Ciphers , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[4]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[5]  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).

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

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

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

[9]  R. Dogaru.  Hybrid cellular automata as pseudo-random number generators with binary synchronization property , 2009, 2009 International Symposium on Signals, Circuits and Systems.

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

[11]  Steven Guan,et al.  Pseudorandom number generation with self-programmable cellular automata , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Willi Meier,et al.  Analysis of Pseudo Random Sequence Generated by Cellular Automata , 1991, EUROCRYPT.

[13]  Dipanwita Roy Chowdhury,et al.  CSHR: Selection of Cryptographically Suitable Hybrid Cellular Automata Rule , 2012, ACRI.

[14]  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..