.png){kind=icon}
.png){kind=icon}
Return
Pseudorandom number generation based on controllable cellular automata
.png){kind=icon}
OA
AI
DOI：10.1016/S0167-739X(03)00128-6.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 (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. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
cellular automata
randomness test
pseudorandom number generators
controllable
hybrid
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
Organization
No organization information available