Please use this identifier to cite or link to this item:
Title: A Family of Controllable Cellular Automata for Pseudorandom Number Generation
Authors: Guan, SU
Zhang, S
Keywords: cellular automata, randomness test, pseudorandom number generator, genetic algorithm
Issue Date: 2002
Publisher: World Scientific Publishing
Citation: Electronic version of an article published as [Sheng-Uei Guan and Shu Zhang, “A Family of Controllable Cellular Automata for Pseudorandom Number Generation”, International Journal of Modern Physics C, 1047-1073, Vol. 13, No. 8, Oct. 2002] [] © [copyright World Scientific Publishing Company] []
Abstract: In this paper, we present a family of novel Pseudorandom Number Generators (PRNGs) based on Controllable Cellular Automata (CCA) ─ CCA0, CCA1, CCA2 (NCA), CCA3 (BCA), CCA4 (asymmetric NCA), CCA5, CCA6 and CCA7 PRNGs. The ENT and DIEHARD test suites are used to evaluate the randomness of these CCA PRNGs. The results show that their randomness is better than that of conventional CA and PCA PRNGs while they do not lose the structure simplicity of 1-d CA. Moreover, their randomness can be comparable to that of 2-d CA PRNGs. Furthermore, we integrate six different types of CCA PRNGs to form CCA PRNG groups to see if the randomness quality of such groups could exceed that of any individual CCA PRNG. Genetic Algorithm (GA) is used to evolve the configuration of the CCA PRNG groups. Randomness test results on the evolved CCA PRNG groups show that the randomness of the evolved groups is further improved compared with any individual CCA PRNG.
ISSN: 0129-1831
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
A Family of Controllable Cellular Automata for Pseudorandom Number Generation.pdf1.29 MBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.