ВАРИАНТ АЛГОРИТМА ГЕНЕРАЦИИ ПСЕВДОСЛУЧАЙНЫХ ДВОИЧНЫХ ПОСЛЕДОВАТЕЛЬНОСТЕЙ, ОСНОВАННЫЙ НА СВОЙСТВАХ ЛИНЕЙНЫХ КЛЕТОЧНЫХ АВТОМАТОВ

Abstract

The article is devoted to the development of a linear system for generating a pseudo-random sequence based on cellular automata, the development of a model for several generators of nonlinear pseudo-random sequences with practical applications in symmetric data transformation systems. Such a model generates all solutions to linear binary difference equations. It is important to note that many of these solutions are pseudo-random keystream sequences. In the process of developing a linear system based on cellular automata, two main structures are considered: linear difference equations and one-dimensional linear hybrid cellular automata. This article shows that all solutions to linear binary difference equations can be implemented using linear models based on cellular automata using the "rule 90" and "rule 150". A model for generating pseudo-random bit sequences has been developed, which is most applicable in communication systems with a high transmission rate. The main difference of this model is that it is built on an exclusively sequential concatenation of a basic linear automaton, which determines the simplicity of the proposed model. Also, an algorithm for controlling the integrity and authenticity of block data was proposed based on the proposed algorithm for generating a pseudo-random sequence. The practical significance lies in the fact that the proposed model is simple and can be applied in information security systems in practice, including in authentication and data integrity control systems.