This paper examines the problem of ensuring information security of new information technologies of the fourth industrial revolution. To solve this problem, a model of an information system in terms of automata theory is proposed. To counteract the quantum threat to information technologies, a complete description of a post-quantum algorithm on algebraic geometry codes, already considered earlier by the authors, is given for the first time. A method for increasing the cryptographic resistance of the proposed algorithm is also proposed.
This paper examines the problem of ensuring information security of new information technologies of the fourth industrial revolution. To solve this problem, a model of an information system in terms of automata theory is proposed. To counteract the quantum threat to information technologies, a complete description of a post-quantum algorithm on algebraic geometry codes, already considered earlier by the authors, is given for the first time. A method for increasing the cryptographic resistance of the proposed algorithm is also proposed.
This paper assesses cryptographic security for new, Fourth Industrial Revolution technologies against quantumenabled risks. In this context, the history of successful attacks on post-quantum cryptography algorithms is reviewed and a thorough cryptographic study of these algorithms' resistance to various cryptographic analysis methods is proposed. The paper also describes an effective attack on a post-quantum algorithm proposed by the authors in earlier studies. This description concludes that using the previously proposed parameters is insecure. Modifying these parameters necessitates further investigation into the cryptographic strength of the post-quantum algorithm.
The development of quantum computers is one of the most significant technological developments of our time, opening new horizons in computing capabilities. However, it also poses serious threats to existing cryptographic algorithms, which are the basis of the security of modern information systems. The paper presents the results of research on post-quantum cryptography and its role in ensuring information security in the context of the development of quantum computers. The purpose of this paper is to compare modern post-quantum, i.e., quantum-stable cryptographic algorithms, assess their applicability for different classes of tasks, and predict the development paths of cryptographic methods for information protection. To achieve this goal, methods of comparative analysis and mathematical modeling are used, which allow for assessing the effectiveness and security of algorithms in different conditions. The study results show that post-quantum algorithms provide reliable information protection in the context of potential quantum attacks while maintaining a high-efficiency level. The conclusions emphasize the need to adapt existing cryptographic systems to new security requirements, particularly through integrating post-quantum algorithms into cloud services and blockchain technologies. The research results can be used to improve data protection mechanisms in information systems and to develop new cryptographic standards in the era of quantum computing. Therefore, plans for future research are outlined, namely: the effectiveness of implementing post-quantum algorithms in various industries, including finance, medicine, and government, will be analyzed; methods for optimizing cryptographic systems will be developed to ensure a balance between security and performance; new mathematical approaches will be studied that can be used to create quantum-resistant algorithms.
This paper discusses ways to ensure the information security of unmanned vehicles and Internet of Things systems under the conditions of a quantum threat. For this, it is proposed to use post-quantum algorithms, a review of the methods for constructing which and works devoted to their application to the considered sphere are given. The construction of a post-quantum algorithm with the help of linear error-correcting codes is considered in detail, for which it is proposed to use algebraic geometry codes with characteristics suitable for implementation in conditions of systems with limited resources. A theorem is proved that makes it possible to guarantee that the automorphism group of some algebro-geometric codes does not allow applying the Sidelnikov-Shestakov attack to them.
This article analyzes the threats to the security of modern cryptographic systems as a result of the development of quantum computers, as well as the formation of the concept of post-quantum cryptography as a solution to these problems. The study justifies the fact that algorithms based on classical public-key cryptosystems, notably RSA, DSA, and elliptic curves, can be corrupted using quantum algorithms. At the same time, new cryptographic systems based on hash-based, code-based, Lattice-based and multivariate quadratic equations are considered as promising directions. The main problems of Post-quantum cryptography with efficiency, reliability and applicability capabilities are also highlighted. As a result, it is indicated that it is necessary to develop new cryptographic standards to ensure future information security.
In the context of the development of quantum computing, traditional cryptographic algorithms used to protect data in industrial controllers are losing their stability. This article is devoted to the analysis of theoretical and applied aspects of the implementation of post-quantum cryptography in industrial automation systems. The existing threats, the architecture of industrial controllers, limitations on computing resources and requirements for cryptographic primitives are considered. An overview of the main classes of post-quantum algorithms, such as lattice, code and hash-based schemes, is provided, and a formalized analysis of security and threat models is carried out. Recommendations for the use of post-quantum solutions are presented, taking into account the features of embedded systems and industrial security standards.
Quantum computing has emerged as a disruptive technology with the potential to revolutionize various fields, including information security. Traditional cryptographic protocols, including RSA, ECC, and AES, rely on the difficulty of certain mathematical problems for their security. However, the advent of quantum computing poses a significant threat to these encryption methods, as quantum algorithms such as Shor's and Grover's algorithms can efficiently solve problems that are computationally hard for classical systems. This paper explores the implications of quantum computing on existing cryptographic systems and proposes strategies for future-proofing information security protocols. We examine the vulnerabilities introduced by quantum computing, highlight the role of post-quantum cryptography (PQC), and explore quantum key distribution (QKD) as potential solutions for ensuring the confidentiality, integrity, and authenticity of digital communications. The paper discusses various quantum-resistant algorithms and offers insights into the ongoing efforts by international standardization bodies to prepare for a post-quantum world.