Method for Parallel Processing of Message Authentication Codes Based on Cellular Automata

The purpose of this work is to develop a system for organizing parallel processing of identifying metrics to maintain high processing speed of message flow and study statistical performance indicators depending on the hardware component and the number of message sources. A message authentication method is proposed that allows for ciphertext block chaining mode without the need to explicitly determine the message index in the chain and design computers based on the actual number of sources and segment size requirements in the message stream. An algorithm for decoding incoming messages based on a fragmented information identifier processed on the basis of cellular automata, optimized for parallel implementation, is considered. For this algorithm, a variant has been proposed for estimating the time costs during preprocessing (decoding) of a set of messages, according to which the use of parallel working segments of a fragmented message identifier allows one to significantly reduce the number of operations for analyzing the individual characteristics of data entering the device per unit of time. A graphical dependence of the processing time on the initial parameters is presented and an analysis of the dependence of the increase in parallel processing speed on the number of sources is carried out, on the basis of which recommendations are formulated for achieving the optimal level of performance. Experimental studies were carried out to confirm the completeness and correctness of the proposed solution.