Efficient and cryptographically secure pseudorandom number generators based on chains of hybrid cellular automata maps

In this paper we consider several solutions for designing cryptographically good pseudo random number generators (PRNG) with low complexity implementations. Our solutions are based on hybrid cellular automata (HCA) maps. The first solution (ensuring maximal throughput) is based on creating chains of HCA maps, i.e. the nonlinear map is changed dynamically being controlled by another HCA map within a chain. The second solution is simpler but somehow reduces the throughput and it is based on the down-sampling of a single HCA output with a factor d. It is shown that both solutions pass all statistical tests of NIST.

[1]  Adriana Vlad,et al.  Computational Measurements of the Transient Time and of the Sampling Distance That Enables Statistical Independence in the Logistic Map , 2009, ICCSA.

[2]  Martin Boesgaard,et al.  Rabbit: A New High-Performance Stream Cipher , 2003, FSE.

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

[4]  Matt Henricksen,et al.  A Critique of Some Chaotic-Map and Cellular Automata-Based Stream Ciphers , 2009, ASIAN.

[5]  Radu Dogaru,et al.  Chaotic Scan: A Low Complexity Video Transmission System for Efficiently Sending Relevant Image Features , 2010, IEEE Transactions on Circuits and Systems for Video Technology.

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

[7]  Radu Dogaru,et al.  HCA101: A chaotic map based on cellular automata with binary synchronization properties , 2010, 2010 8th International Conference on Communications.

[8]  Ping Ping,et al.  Generating High-Quality Random Numbers by Next Nearest-Neighbor Cellular Automata , 2013 .

[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]  Radu Dogaru,et al.  APPLICATIONS OF NATURAL COMPUTING IN CRYPTOLOGY: NLFSR BASED ON HYBRID CELLULAR AUTOMATA WITH 5-CELL NEIGHBORHOOD , 2013 .

[11]  Adriana Vlad,et al.  GENERATING CHAOTIC SECURE SEQUENCES USING TENT MAP AND A RUNNING-KEY APPROACH , 2013 .

[12]  M. Baptista.  Cryptography with chaos , 1998 .

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

[14]  Radu Dogaru,et al.  Algebraic normal form for rapid prototyping of elementary hybrid cellular automata in FPGA , 2010, 2010 3rd International Symposium on Electrical and Electronics Engineering (ISEEE).

[15]  Radu Dogaru,et al.  FPGA implementation and evaluation of two cryptographically secure hybrid cellular automata , 2014, 2014 10th International Conference on Communications (COMM).