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

Authors:
Sang-Ho Shin;Geum-Dal Park;Kee-Young Yoo
Affiliations:
Department of Computer Engineering, Kyungpook National University, Daegu, South Korea 702-701;School of Electrical Engineering and Computer Science, Kyungpook National University, Daegu, South Korea 702-701;Department of Computer Engineering, Kyungpook National University, Daegu, South Korea 702-701
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 7
Cited 2

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Generating high-quality random numbers in parallel by cellular automata

Future Generation Computer Systems - Special issue on cellular automata: promise in computational science
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata

IEEE Transactions on Computers
Genetic Algorithms in Engineering and Computer Science

Genetic Algorithms in Engineering and Computer Science
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice
Short communication: Evolving cellular automata to generate nonlinear sequences with desirable properties

Applied Soft Computing
2-D CA variation with asymmetric neighborship for pseudorandom number generation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Chaotic encryption method based on life-like cellular automata

Expert Systems with Applications: An International Journal
On the combination of self-organized systems to generate pseudo-random numbers

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.