Generating High-Quality Random Numbers by Next Nearest-Neighbor Cellular Automata

DOI

10.2991/icsem.2013.173How to use a DOI?

Keywords

cryptography, random number generator, cellular automata, NIST statistical test suite

Abstract

Cellular automaton (CA) has been widely investigated as random number generators (RNGs). However, the CA rule and the number of neighbors must be chosen carefully for good randomness. In Ref. [11], non-uniform CA with next nearest neighborhood was applied to generate a pseudo-random sequence. Considering that non-uniform CA has more complex implementation in hardware and needs lager memory to store different rules than uniform CA. In this paper, we propose new RNGs based on uniform CA with next nearest neighborhood. Time spacing technique and NIST statistical test suite are used to find optimal rules for uniform CA. Experiment results show that the sequences generated by uniform CA with optimal rules successfully passed all tests in the NIST suite.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ping Ping
AU  - Feng Xu
AU  - Zhi-Jian Wang
PY  - 2013/04
DA  - 2013/04
TI  - Generating High-Quality Random Numbers by Next Nearest-Neighbor Cellular Automata
BT  - Proceedings of the 2nd International Conference On Systems Engineering and Modeling (ICSEM 2013)
PB  - Atlantis Press
SP  - 838
EP  - 842
SN  - 1951-6851
UR  - https://doi.org/10.2991/icsem.2013.173
DO  - 10.2991/icsem.2013.173
ID  - Ping2013/04
ER  -