A Variant of the Algorithm for Generating Pseudo-random Binary Sequences Based on the Properties of Linear Cellular Automata

Abstract

AbstractThe aim of the work is to develop a linear system for generating a pseudo-random sequence based on cellular automata, develop a model for several generators of nonlinear pseudo-random numbers with practical applications in symmetric data conversion systems. This model generates all solutions to linear binary difference equations. It is important to note that many of these solutions are pseudo-random key stream sequences. Thus, a linear structure based on cellular automata can be used to generate not only the solution of difference equations, but also to create such sequences. The proposed model is very simple, since it is based solely on the sequential concatenation of a basic linear automaton. 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. An algorithm for controlling the integrity and authenticity of block data was also proposed based on the proposed algorithm for generating a pseudo-random sequence. The proposed model is simple and can be applied in information security systems in practice, including in authentication and data integrity control systems. #CSOC1120.KeywordsInformation securityData streamingCellular automata