METHODOLOGY FOR FORMING A HIGH-SPEED IMITATOR-RESISTANT CIPHER FOR MULTI-ALPHABET SUBSTITUTION
DOI:
https://doi.org/10.28925/2663-4023.2024.26.723Keywords:
cybersecurity, encryption, cryptography, cryptographic protection, crypto algorithm, threat, information protection, confidentiality, integrity, tamper resistance, critical infrastructure object.Abstract
The article considers the problems and tasks of forming requirements for the construction of a high-speed imitation-resistant multi-alphabet substitution cipher based on the principles of rotary systems, which is relevant in terms of ensuring cybersecurity of critical infrastructure facilities with an increased risk of disruption of stable operation. The ontological model of the functional security entities of automated process control systems (APCS) at critical infrastructure facilities (CIF) is analysed. It is determined that the tools for improving functional security in this case should be measures and means of cyber defence aimed at preventing the implementation of threats of interception, analysis and imitation of critical technological information and ensuring the adjustment of the chosen security policy. It is emphasised that an important component of the functional security of systems and complexes of critical infrastructure facilities is the protection of critical technological information during its transmission via public communication channels. An effective mechanism for counteracting these threats is the use of a multi-alphabet substitution cipher, for which purpose a corresponding model is proposed, based on the mathematical principles of constructing rotary encryption systems, which, within the framework of the model, are devoid of their inherent vulnerabilities. The model provides a two-stage transformation of open data using data from a pseudorandom sequence generator, which is a modified model of the A5/1 algorithm that has the necessary functional and cryptographic characteristics. The considered factors of ensuring the cryptographic security of the proposed model allowed us to reasonably propose a high-speed solution for calculating the message authentication code directly in the encryption process.
Downloads
References
On Information, Law of Ukraine №2657-XII (2024) (Ukraine). https://zakon.rada.gov.ua/laws/show/2657-12#Text
Buryachok, V. L. (2013). Fundamentals of the formation of the state system of cyber security: a monograph. Kyiv: NAU.
Was there a cyberattack on regional power companies? - BBC News Ukraine. (2016). BBC News Ukraine. https://www.bbc.com/ukrainian/society/2016/01/160106_cyber_attacks_electricity_ukraine_vc.
On Critical Infrastructure, Law of Ukraine №1882-IX (2024) (Ukraine). https://zakon.rada.gov.ua/laws/show/1882-20#Text
State Enterprise ‘Ukrainian Research and Training Centre for Standardisation, Certification and Quality Problems’ (SE ‘UkrNDNC’) (2019). Functional safety of electrical, electronic, programmable electronic systems related to safety. Part 1: General requirements (EN 61508-1:2010, IDT; IEC 61508-1:2010, IDT) (DSTU EN 61508-1:2019). https://online.budstandart.com/ua/catalog/doc-page.html?id_doc=84383
Hulak, H., Zhdanova, Y., Skladannyi, P., Hulak, E., & Korniets, V. (2022). Vulnerabilities of encryption of short messages in mobile information and communication systems of critical infrastructure. Electronic professional scientific publication “Cyber Security: Education, Science, Technology”, 1(17), 145–158. https://doi.org/10.28925/2663-4023.2022.17.145158
Chernenko, R. (2023). Generation of pseudorandom sequences on microcontrollers with limited computing resources, sources of entropy and testing of statistical properties. Electronic professional scientific publication “Cybersecurity: Education, Science, Technology”, 2(22), 191–203. https://doi.org/10.28925/2663-4023.2023.22.191203
Vorokhob, M., Kyrychok, R., Yaskevych, V., Dobryshyn, Y., & Sydorenko, S. (2023). Modern prospects of applying the Zero Trust concept in building an enterprise information security policy. Electronic professional scientific publication “Cybersecurity: Education, Science, Technology”, 1(21), 223–233. https://doi.org/10.28925/2663-4023.2023.21.223233
Gorbenko, I. D., & Gorbenko, Y. I. (2012). Applied cryptology: Theory. Practice. Application: monograph. Kharkiv: FORT.
Gorbenko, Y. D. (2015). Construction and analysis of systems, protocols and means of cryptographic protection of information: monograph. Kharkiv: FORT.
Hulak, H. M., Kashchuk, V. I., & Skladannyi, P. M. (2018). Refined model of the offender and model of cyberattacks implementation in technological process control systems. Actual Problems of State Information Security Management. In: IX All-Ukrainian Scientific and Practical Conference, 47–49.
Hulak, E. (2024). Methods of rational synthesis of the cryptographic information security subsystem in critical infrastructure networks. Electronic professional scientific publication “Cybersecurity: Education, Science, Technology”, 4(24), 282–297. https://doi.org/10.28925/2663-4023.2024.24.282297
Korniets, V., & Chernenko, R. (2023). Modification of the cryptographic algorithm A5/1 to ensure the communication of IOT devices. Electronic professional scientific publication “Cybersecurity: Education, Science, Technology”, 4(20), 253–271. https://doi.org/10.28925/2663-4023.2023.20.253271
Chernenko, R. (2023). Performance evaluation of lightweight cryptography algorithms on limited 8-bit devices. Electronic professional scientific publication “Cybersecurity: Education, Science, Technology, 1(21), 273–285. https://doi.org/10.28925/2663-4023.2023.21.273285
Hulak, H. M., & Skladannyi, P. M. (2017). Ensuring the reliability of automated control and data transmission systems of unmanned aerial vehicles. Mathematical machines and systems, 3, 154–161.
Hulak, H. M., Buryachok, V. L., & Skladannyi, P. M. (2017) Fast algorithm for generating substitutions of multi-alphabetical substitution. Information security, 2, 173–177.
Glukhov, M. M., Zubov, A. Y. (1999). On the lengths of symmetric and familiar substitution groups in different systems of formations (review). Mathematical questions of cybernetics, 8, 5–32.
Konheim, A. G. (1981). Cryptography: A prime. Wiley & Sons, Incorporated, New York.
Sherstnev, V. I. (1997). Random variable uniformly distributed on a finite abelian group as sum of independent summands Theory Probab. Appl. Journal, 43(2), 329–335
Berend, D., & Mamana, S. (2021). On random permutations of finite groups. Journal of Algebraic Combinatorics (2021)54, 515–528. https://doi.org/10.1007/s10801-020-00999-4
Alekseichuk, A. N., & Konyushok, S. N. (2012). Fourier transform and cryptographic properties of Boolean functions: Tutorial. K.: ISZI NTUU ‘KPI’.
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Віктор Корнієць, Юлія Жданова

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.