Pseudorandom number generation based on controllable cellular automata

Sheng Uei Guan*, Shu Zhang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


A novel cellular automata (CA) - controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudorandom number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (1D) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of 1D 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.

Original languageEnglish
Pages (from-to)627-641
Number of pages15
JournalFuture Generation Computer Systems
Issue number4
Publication statusPublished - 3 May 2004
Externally publishedYes


  • Cellular automata
  • Controllable
  • Hybrid
  • Pseudorandom number generator
  • Randomness test


Dive into the research topics of 'Pseudorandom number generation based on controllable cellular automata'. Together they form a unique fingerprint.

Cite this