A Virtual Three-Dimension Cellular Automata Pseudorandom Number Generator Based on the Moore Neighborhood Method

Abstract

The security of a One-time Pad Cryptography system depends on the keystream generator, which has been studied to produce a high randomness quality over the last thirty years. A Cellular Automata (CA) Pseudorandom Number Generator (PRNG) is more efficiently implement rather than LFSR, Linear Congruential generator, Fibonacci generator, etc.. Moreover, a CA structure-based PRNG is highly regular and simpler than previous PRNGs. Accordingly, we propose a new PRNG based on a virtual three-dimension (3-D) CA with the Moore neighborhood structure. In order to evaluate the quality of randomness, the ENT and the DIEHARD test suites are used. The results of these tests show that the quality of randomness is better than previous PRNGs.