THE COMPLEXITY OF THE FUNCTIONAL SECURITY ASSESSMENT ALGORITHM FOR INFORMATION TECHNOLOGIES FOR THE CREATION OF WARRANTY AUTOMATED SYSTEMS
DOI:
https://doi.org/10.28925/2663-4023.2020.9.623Keywords:
guarantee capacity, reliability, functional security, functional security of cryptographic subsystem, cryptographic attack, stability of cryptographic transformation, basic decoding, Hamming distance, fast Hadamard transformation, Walsh-Hadamard transformation, Reed-Muller code.Abstract
The complexity of the algorithm of communication of the system of linear levels with open regular parts by means of list decoding of "shortened" codes of reed painters which are intended for use in methods of an estimation of functional safety of cryptographic algorithms of cryptographic subsystems of the guaranteed automated systems creating on objects of critical infrastructure and socially important objects. This paper proposes solving problems to assess the complexity of the proposed algorithm. As a result, the upper estimates of the average labor productivity for the general case and the maximum complexity of the proposed algorithm for many special reviews related to the restoration of the formed linear results of the maximum period over a field of two elements. The achievable upper part of the list, which is formed using the proposed algorithm, is also indicated. The obtained results indicate that with certain collaborations between the parameters of the previously proposed algorithm, the time complexity was changed in comparison with the previously known deterministic algorithm for a similar purpose, which is based on the fast Hadamara transformation. This means that a more effective tool can be used to assess the impact of cryptographic subsystems on powerful cyberattacks to obtain a more accurate assessment of their functional security.
Downloads
References
Hulak, Н., 2020. The method of evaluating the functional safety of information technologies for the establishment of guaranteed publishing automation systems. Cybersecurity: Education, Science, Technique", 3 (7), pp.153-164, https://doi.org/10.28925/2663-4023.2020.7.153164
Alferov A.P., Zubov A.Yu., Kuzmin A.S., Cheremushkin A.V., Fundamentals of Cryptography: Textbook. M .: Helios ARV, 2001, p. 480.
Panasenko S.P., Encryption algorithms. Special reference book. SPb .: BHV-Petersburg, 2009, p. 576
S.O. Sushko, G.V. Kuznetsov, L. Ya. Fomichova, A.V. Korablev Mathematical foundations of cryptanalysis: navch. google. - D .: National Girnichiy University, 2010 , 465 p.
Babash A.V., Shankin G.P., Cryptography. / Edited by V.P. Sherstyuk, E.A. Applied. M .: SOLON-R, 2002 , 512 p.
Yu.S. Kharin, V.I. Bernik, G.V. Matveev, S.V. Agnevich. Mathematical and computer foundations of cryptology: Textbook, Minsk: New knowledge, 2003, 382 p.
Dumer II, Kabatiansky GA, Tavernier S. List decoding of first-order Reed-Muller binary codes. Information transfer problems. - 2007. - T. 43. - Issue. 3, р. 66 - 74.
Sidelnikov V.M. Fast algorithms for constructing a set of markings for discrete arrays of information // Proceedings of discrete mathematics. - T. 1. - M .: TVP, 1997 , р. 251 - 264.
N. Ahmed, K.R. Rao Orthogonal transformations in digital signal processing: Per. from English / Ed. I.B. Fomenko. - M .: Communication, 1980, 248 p.
McWilliams F. J., Sloane N. J. A. Theory of error-correcting codes: Trans. from English - M: Communication, 1979, 744 p.
Korobov N.M. Trigonometric sums and their applications. - M .: Science. Ch. ed. physical-mat. lit., 1989, 240 p.
Sidelnikov V.M. Estimates for the number of occurrences of signs on a segment of a recurrent sequence over a finite field // Discrete Mathematics. - 1991. - T. 3. - Issue. 2. - р. 87 - 95.
Shparlinsky I.Ye. On some properties of linear cyclic codes // Problems of information transmission. - 1983. - T. 19. - Issue. 3. - р. 106 - 110.
Logachev O.A., Salnikov A.A., Yashchenko V.V. Boolean functions in coding theory and cryptology. - M .: MTsNMO, 2004 .- 470 p.
Moldovyan A.A. Cryptography. High-speed ciphers // BHV-Petersburg, 2002. ISBN 594157214X, ISBN 9785941572144.496 p.
Discrete mathematics and mathematical problems of cybernetics. T. 1 / Under total. ed. S.V. Yablonsky and O.B. Lupanov. - M .: Nauka, 1974 , - 312 p.
