2021 International Russian Automation Conference (RusAutoCon) | 2021
The Computational Complexity of the Algorithm for Identifying the Source of Data Transmitted by Limited Length Blocks
Abstract
In a number of modern automated systems, the interaction between their individual components occurs in data blocks of several tens of bytes and even of several bytes long. This happens due to the requirements for the duration of the frame transmission in time sharing systems for the duration of the frame processing, the requirements for the power consumption of transmitters, etc. In such systems, it is not possible to provide reliable identification and authentication of the stoker using traditional block cipher algorithms. Cipher Block Chaining provides higher confidence in authentication procedures. At the same time, the practical implementation generally requires performing a large number of typical operations on the received data blocks. The article describes the possible way of using Cipher Block Chaining. It also considers a mathematical model for assessing its computational complexity of the data processing algorithm and provides the recommended ranges of operating parameters of automated systems for using the algorithm.