CASPIAN JOURNAL
MANAGEMENT AND HIGH TECHNOLOGIES
INCREASING THE SPEED OF ERROR DETECTION WHEN FORMING CHAINS OF DATA BLOCKS BASED ON THE ANALYSIS OF THE NUMBER OF HASH MATCHES
 |
Read | Tanygin Maxim O., Kuleshova Elena A., Mitrofanov Alexey V., Gladilina Elena Yu. INCREASING THE SPEED OF ERROR DETECTION WHEN FORMING CHAINS OF DATA BLOCKS BASED ON THE ANALYSIS OF THE NUMBER OF HASH MATCHES // Caspian journal : management and high technologies. — 2022. — №1. — pp. 85-93. |
Tanygin Maxim O. - Cand. Sci. (Engineering), Associate Professor, Head of the Department of Information Security, Southwest State University, tanygin@yandex.ru
Kuleshova Elena A. - Lecturer at the Department of Software Engineering, Southwest State University, lena.kuleshova.94@mail.ru
Mitrofanov Alexey V. - Postgr. St. of the Department of Information Security, Southwest State University, mitro3000@rambler.ru
Gladilina Elena Yu. - student, Southwest State University, elena.gladilina@inbox.ru
The article investigates the practical implementation of a system for monitoring the integrity and authenticity of information based on CBC codes in order to increase the speed of error detection when forming chains of data blocks. As part of the implementation of the scheme for checking data blocks, it is proposed to form tree-like structures of information blocks by analyzing the attributes of the latter, while the fact of an error is determined on the basis of the number and length of branches in such a tree-like structure. The article proposes a method for determining the source of messages, which is based on the analysis of the MAC content and the message index in the sequence between two service messages: start, which is the root of the tree structure, and stop, which should be the last message in the branch. The study is based on a mathematical model of the formation of a tree structure, on the basis of which recurrent dependencies for the probability of the formation of branches from the root message and the probability of the formation of different values of MAC messages of these branches are obtained. The paper shows that there is a relationship between the number of branches of the tree structure, generated by coincidences of the values of the attributes of information blocks, and the probability of error in determining the source. Based on the estimates obtained, a rule for processing branches of a tree structure for messages of limited length is formulated in the work. Experimental studies have shown that the application of this rule will increase the share of useful information processed by the receiver by 2-5 % by reducing the number of data blocks requested as a result of detected authentication errors.
Key words: data transmission, message receiver, authentication system, data block chains, error detection rate