Maximum-length sequences, cellular automata, and random numbers

Random numbers are needed in a variety of applications, yet finding good random number generators is a difficult task. In this paper non-uniform cellular automata (CA) are studied, presenting the cellular programming algorithm for co-evolving such CAs to perform computations. The algorithm is applied to the evolution of random number generators; our results suggest that evolved generators are at least as good as previously described CAs, with notable advantages arising from the existence of a "tunable" algorithm for obtaining random number generators.

Download Full-text

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

Proceedings of the 2nd International Conference On Systems Engineering and Modeling ◽

10.2991/icsem.2013.173 ◽

2013 ◽

Cited By ~ 4

Author(s):

Ping Ping ◽

Feng Xu ◽

Zhi-Jian Wang

Keyword(s):

Cellular Automata ◽

Nearest Neighbor ◽

Random Numbers ◽

High Quality

Download Full-text

On the generation of high-quality random numbers by two-dimensional cellular automata

IEEE Transactions on Computers ◽

10.1109/12.888056 ◽

2000 ◽

Vol 49 (10) ◽

pp. 1146-1151 ◽

Cited By ~ 77

Author(s):

M. Perrenoud ◽

M. Sipper ◽

M. Tomassini

Keyword(s):

Cellular Automata ◽

Random Numbers ◽

Two Dimensional ◽

High Quality

Download Full-text

Central Limit Theorem based Cellular Automata for Generating Normal Random Numbers

Information Technology Journal ◽

10.3923/itj.2013.2440.2446 ◽

2013 ◽

Vol 12 (12) ◽

pp. 2440-2446 ◽

Cited By ~ 3

Author(s):

Alireza Jaberi ◽

Ramin Ayanzadeh ◽

Elaheh Raisi ◽

Aidin Sadighi

Keyword(s):

Central Limit Theorem ◽

Limit Theorem ◽

Cellular Automata ◽

Central Limit ◽

Random Numbers

Download Full-text

Pseudorandom Number Generators Based on Cellular Automata

Advances in Systems Analysis, Software Engineering, and High Performance Computing - Formation Methods, Models, and Hardware Implementation of Pseudorandom Number Generators ◽

10.4018/978-1-5225-2773-2.ch003 ◽

2017 ◽

pp. 52-65

Keyword(s):

Cellular Automata ◽

Random Number ◽

Pseudorandom Number ◽

Random Numbers ◽

Random Number Generators ◽

One Dimensional ◽

Pseudorandom Number Generators ◽

Pseudo Random Number ◽

The Creation

In this chapter, the author considers the main theoretical solutions for the creation of pseudo-random number generators based on one-dimensional cellular automata. A Wolfram generator is described on the basis of rule 30. The main characteristics of the Wolfram generator is presented. The analysis of hybrid pseudo-random number generators based on cellular automata is carried out. Models of such generators and their realization with various forms of neighborhoods are presented. Also in the chapter is presented the analysis of the basic structures and characteristics of pseudo-random number generators using additional sources of pseudo-random numbers. As such additional sources the LFSR is used.

Download Full-text