Reconfigurable Pseudo-Random Number Generator Based on Cellular Automata

Author(s):  
Jie Chi ◽  
Li-hua Dong ◽  
Yong Zeng
2020 ◽  
Vol 8 (6) ◽  
pp. 5741-5748

This paper proposes a hybrid programmable two-dimensional Cellular Automata (CA) based pseudo-random number generator which includes a newly designed rule set. The properties and evolution of one and two dimensional CA are revisited. The various metrics for evaluating CA as a Pseudo-Random Number Generator (PRNG) are discussed. It is proved that the randomness is high irrespective of the initial seed by applying this newly designed rule set. The PRNG is tested against a popular statistical test called Diehard test suite and the results show that the PRNG is highly random. The chaotic measures like entropy, hamming distance and cycle length have been measured


2020 ◽  
Vol 31 (03) ◽  
pp. 2050037
Author(s):  
Sumit Adak ◽  
Kamalika Bhattacharjee ◽  
Sukanta Das

This work explores the randomness quality of maximal length cellular automata (CAs) in GF([Formula: see text]), where [Formula: see text]. A greedy strategy is chosen to select the candidate CAs which satisfy unpredictability criterion essential for a good pseudo-random number generator (PRNG). Then, performance of these CAs as PRNGs is empirically analyzed by using Diehard battery of tests. It is observed that, up to GF(11), increase in [Formula: see text] improves randomness quality of the CAs, but after that, it saturates. Finally, we propose an implementable design of a good PRNG based on a 13-cell maximal length cellular automaton over GF(11) which can compete with the existing well-known PRNGs.


The fifth chapter deals with the use of hybrid cellular automata for constructing high-quality pseudo-random number generators. A hybrid cellular automaton consists of homogeneous cells and a small number of inhomogeneous cells. Inhomogeneous cells perform a local function that differs from local functions that homogeneous cells realize. The location of inhomogeneous cells and the main cell is chosen in advance. The output of the main cell is the output of a pseudo-random number generator. A hardware implementation of a pseudo-random number generator based on hybrid cellular automata is described. The local function that an inhomogeneous cell realizes is the majority function. The principles of constructing a pseudo-random number generator based on cellular automata with inhomogeneous neighborhoods are described. In such cellular automata, inhomogeneous cells have a neighborhood whose shape differs from that of neighborhoods of homogeneous cells.


2013 ◽  
Vol 16 (2) ◽  
pp. 210-216 ◽  
Author(s):  
Sattar B. Sadkhan ◽  
◽  
Sawsan K. Thamer ◽  
Najwan A. Hassan ◽  
◽  
...  

Micromachines ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 31
Author(s):  
Junxiu Liu ◽  
Zhewei Liang ◽  
Yuling Luo ◽  
Lvchen Cao ◽  
Shunsheng Zhang ◽  
...  

Recent research showed that the chaotic maps are considered as alternative methods for generating pseudo-random numbers, and various approaches have been proposed for the corresponding hardware implementations. In this work, an efficient hardware pseudo-random number generator (PRNG) is proposed, where the one-dimensional logistic map is optimised by using the perturbation operation which effectively reduces the degradation of digital chaos. By employing stochastic computing, a hardware PRNG is designed with relatively low hardware utilisation. The proposed hardware PRNG is implemented by using a Field Programmable Gate Array device. Results show that the chaotic map achieves good security performance by using the perturbation operations and the generated pseudo-random numbers pass the TestU01 test and the NIST SP 800-22 test. Most importantly, it also saves 89% of hardware resources compared to conventional approaches.


Sign in / Sign up

Export Citation Format

Share Document