Pseudorandom Pattern Generation Using 3-State Cellular Automata

Bilan²,

2017

MATEC Web Conf.

Abstract. To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. These tasks do not give advance known result. The solution of such problems is based on the construction of a dynamic model of the object. Successful structural and functional implementation of the object model can give a positive result in time. This approach uses the task of constructing artificial biological objects. To solve such problems, pseudo-random number generators are used, which also find wide application for information protection tasks. Such generators should have good statistical properties and give a long repetition period of the generated pseudo-random bit sequence. This work is aimed at improving these characteristics. The paper considers the method of forming pseudo-random sequences of numbers on the basis of aperiodic cellular automata with two active cells. A pseudo-random number generator is proposed that generates three bit sequences. The first two bit sequences are formed by the corresponding two active cells in the cellular automaton. The third bit sequence is the result of executing the XOR function over the bits of the first two sequences and it has better characteristics compared to them. The use of cellular automata with two active cells allowed to improve the statistical properties of the formed bit sequence, as well as its repetition period. This is proved by using graphical tests for generators built based on cellular automata using the neighborhoods of von Neumann and Moore. The tests showed high efficiency of the generator based on an asynchronous cellular automaton with the neighborhood of Moore. The proposed pseudo-random number generators have good statistical properties, which makes it possible to use them in information security systems, as well as for simulation tasks of various dynamic processes.

Section: Introductionmentioning

confidence: 99%

Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

Bilan²,

2017

MATEC Web Conf.

“…The simple structure of CA with logical interconnections is ideally suited for hardware implementation. For these reasons CA have been used for various applications such as pattern classification ( [2], [3]), cryptography ([4] ~ [8]), and pseudorandom-number generation, etc. ( [9] ~ [12]).…”

Section: Introductionmentioning

confidence: 99%

Analysis of 90/150 CA Concatenated using Inverse Symmetric Transition Rule

Choi¹,

Cho²,

Kim³

et al. 2017

IJCA

Advances in Systems Analysis, Software Engineering, and High Performance Computing

Pseudorandom Number Generators Based on Cellular Automata

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.