Pseudorandom number generation based on controllable cellular automata

Authors:
Sheng-Uei Guan;Shu Zhang
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescents, Singapore 119260, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescents, Singapore 119260, Singapore
Venue:
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
Year:
2004

Citing 10
Cited 1

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Parallel Random Number Generation for VLSI Systems Using Cellular Automata

IEEE Transactions on Computers
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
A class of two-dimensional cellular automata and their applications in random pattern testing

Journal of Electronic Testing: Theory and Applications
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Simple cellular automata as pseudorandom m-sequence generators for built-in self-test

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Generating high-quality random numbers in parallel by cellular automata

Future Generation Computer Systems - Special issue on cellular automata: promise in computational science
A brief history of cellular automata

ACM Computing Surveys (CSUR)
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata

IEEE Transactions on Computers
Security Examination of a Cellular Automata Based Pseudorandom Bit Generator Using an Algebraic Replica Approach

AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Securing heap memory by data pointer encoding

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel cellular automata (CA)--controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudo-random number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (ID) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of ID CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired.