Please use this identifier to cite or link to this item:
|Title:||Incremental evolution of cellular automata for random number generation||Authors:||Guan, S.-U.
|Keywords:||Controllable cellular automata
Pseudorandom number generation
|Issue Date:||Sep-2003||Citation:||Guan, S.-U., Zhang, S. (2003-09). Incremental evolution of cellular automata for random number generation. International Journal of Modern Physics C 14 (7) : 881-896. ScholarBank@NUS Repository. https://doi.org/10.1142/S0129183103005017||Abstract:||Cellular automata (CA) have been used in pseudorandom number generation for over a decade. Recent studies show that controllable CA (CCA) can generate better random sequences than conventional one-dimensional (ID) CA and compete with two-dimensional (2D) CA. Yet the structural complexity of CCA is higher than that of ID programmable cellular automata (PCA). It would be good if CCA can attain a good randomness quality with the least structural complexity. In this paper, we evolve PCA/CCA to their lowest complexity level using genetic algorithms (GAs). Meanwhile, the randomness quality and output efficiency of PCA/CCA are also evolved. The evolution process involves two algorithms - a multi-objective genetic algorithm (MOGA) and an algorithm for incremental evolution. A set of PCA/CCA are evolved and compared in randomness, complexity, and efficiency. The results show that without any spacing, the CCA could generate good random number sequences that could pass DIEHARD. To obtain the same randomness quality, the structural complexity of the CCA is not higher than that of ID CA. Furthermore, the methodology developed could be used to evolve other CA or serve as a yardstick to compare different types of CA.||Source Title:||International Journal of Modern Physics C||URI:||http://scholarbank.nus.edu.sg/handle/10635/56309||ISSN:||01291831||DOI:||10.1142/S0129183103005017|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.