Please use this identifier to cite or link to this item:
Title: A family of controllable cellular automata for pseudorandom number generation
Authors: Guan, S.-U. 
Zhang, S. 
Keywords: Cellular automata
Genetic algorithm
Pseudorandom number generator
Randomness test
Issue Date: Oct-2002
Citation: Guan, S.-U., Zhang, S. (2002-10). A family of controllable cellular automata for pseudorandom number generation. International Journal of Modern Physics C 13 (8) : 1047-1073. ScholarBank@NUS Repository.
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 1D CA. Moreover, their randomness can be comparable to that of 2D 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 as compared with any individual CCA PRNG.
Source Title: International Journal of Modern Physics C
ISSN: 01291831
DOI: 10.1142/S0129183102003863
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



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