Novel pseudo-random sequence of numbers generator based cellular automata

Abstract

STEPAN BILAN, MYKOLA BILAN, SERGII BILAN NOVEL PSEUDO-RANDOM SEQUENCE OF NUMBERS GENERATOR BASED CELLULAR AUTOMATAThis paper considers a novel pseudo-random bit sequence generator, which is implemented on a cellular automaton. It presents the hardware implementation of the generator and it the software simulation. With the help of the software model is testing of the random number generator was conducted. Tests showed a positive result, which confirms the high statistical properties of the generated random sequence.

A Pseudorandom Number Generator With Full Cycle Length Based on Automata Compositions

“…From now on we assume that A 1 is a permutation automaton having δ A1 (a, x) = δ A1 (a, x ) for every a, x, x ∈ Σ, x = x , and we say that B is a key-automaton with respect to the permutation automaton A 1 called the basic automaton of B. 2 Theorem 1 in [6] concerns key automata consisting of basic automata having a transition table forming a Latin cube. The next statement is formally the same but, of course, it concerns key automata consisting of basic automata having a transition table forming a Latin square.…”

“…The first pseudorandom number generator based on cellular automata was proposed by S. Wolfram [29,30] and there are many pseudorandom generators based on cellular automata today. (See [2]- [5], [8]- [16], [19,20], [23]- [28]).…”