.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
cellular automata
randomness test
pseudorandom number generators
controllable
hybrid
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容