Kibernetyka ta Systemnyi Analiz

BEYOND POST-QUANTUM CRYPTOGRAPHY: CRYPTOSYSTEMS SECURE IN CERTAIN MODELS OF COMPUTATION

V. K. Zadiraka, Антон Михайлович Кудін, I. A. Kudin, Інна Віталіївна Швідченко

Published Jan 1, 2025• 0 citations

Abstract

The problem of assessing the stability of cryptographic transformations in modern cryptography, which is usually implemented using an axiomatic or proof-based approach, is considered. Since the quantum computing model changes the complexity of certain computational problems (for example, integer factorization problems), cryptography studies classes of algorithms that will remain stable in the quantum computing model—the so-called “post-quantum cryptographic algorithms.” A generalization of this problem statement is the study of computational models containing cryptanalysis algorithms, the best of which has exponential complexity or complexity close to it. The generalization of the problem of the existence of cryptosystems that are secure in the post-quantum world, namely, cryptosystems that are secure in certain computational models, as well as the possibility of practical application of such models, is considered. The main result of the work is the creation of a universal computational model that generalizes a whole class of promising computational models, including quantum ones, and the construction of a cryptosystem that is stable within such a computational model. Keywords: post-quantum cryptography, relativized cryptography, computing models, genetic algorithms, reversible computing, blockchain.

DOI: 10.34229/kca2522-9664.25.6.1

Related papers

CRYPTOGRAPHIC SECURITY IN THE ERA OF QUANTUM COMPUTERS: THE CONCEPT AND DEVELOPMENT PROSPECTS OF POST-QUANTUM CRYPTOGRAPHY

Dilnoz Muhamediyeva, Farhad Tagaev

This article analyzes the threats to the security of modern cryptographic systems posed by the development of quantum computers, as well as the emergence of the concept of post-quantum cryptography as a solution to these problems. The study demonstrates that classical public-key cryptosystems, particularly RSA, DSA, and elliptic curve-based algorithms, can be broken using quantum algorithms. At the same time, new cryptographic systems based on hash functions, codes, lattices, and multivariate quadratic equations are considered a promising direction. The main challenges related to the efficiency, reliability, and applicability of post-quantum cryptography are also highlighted. As a result, the necessity of developing new cryptographic standards to ensure future information security is demonstrated.

May 3, 20260 citations

QUANTUM COMPUTING FOR CRYPTOGRAPHY: EXPLORING THE FUTURE OF SECURE COMMUNICATIONS WITH QUANTUM ALGORITHMS

Arslan Nadeem, Aiman Shabbir

Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.

Journal of Engineering Education and PracticeDec 31, 20230 citations

MATHEMATICAL FOUNDATIONS, ALGORITHMS AND SECURITY ANALYSIS POST-QUANTUM CRYPTOGRAPHY

Dilnoz Muhamediyeva, Farkhad Tagaev

The rapid development of quantum computing technologies poses a serious threat to modern public-key cryptographic systems. Classical cryptographic algorithms such as RSA and elliptic-curve cryptography rely on mathematical problems that can be efficiently solved using quantum algorithms. Post-quantum cryptography (PQC) aims to develop cryptographic schemes that remain secure even in the presence of quantum adversaries. This paper investigates the mathematical foundations of PQC, focusing on lattice-based, code-based, and hash-based cryptographic constructions. Security models based on computational complexity theory are analyzed, and illustrative examples using Learning With Errors (LWE) and decoding problems are presented. Experimental analysis demonstrates that PQC schemes provide strong resistance against both classical and quantum attacks when appropriate parameters are selected. The results highlight the importance of adopting new cryptographic standards to ensure long-term data security in quantum computing environments.

May 3, 20260 citations

Quantum Attacks on Modern Cryptography and Post-Quantum Cryptosystems

Zachary Marron

Cryptography is a critical technology in the modern computing industry, but the security of many cryptosystems relies on the difficulty of mathematical problems such as integer factorization and discrete logarithms. Large quantum computers can solve these problems efficiently, enabling the effective cryptanalysis of many common cryptosystems using such algorithms as Shor’s and Grover’s. If data integrity and security are to be preserved in the future, the algorithms that are vulnerable to quantum cryptanalytic techniques must be phased out in favor of quantum-proof cryptosystems. While quantum computer technology is still developing and is not yet capable of breaking commercial encryption, these steps can be taken immediately to ensure that the impending development of large quantum computers does not compromise sensitive data.

Jan 1, 20180 citations

Post-Quantum Cryptography for Navigating Challenges and Exploring Opportunities

Tejinder Sharma, Shivangi, Rishab Sharma

The rise of quantum computing poses a significant threat to the security of such classical cryptographic systems, as they inherently depend on the computational difficulty of problems such as integer factorization and discrete logarithm. Examining Theoretical Foundations of Post-Quantum Cryptography: Challenges and Opportunities for Building Secure Cryptographic Protocols in the PostQuantum World This paper aims to explore how quantum computers will affect the current state of cryptography, contributing towards the ongoing discussion to upgrade our cryptographic systems' foundations in the face of potential quantum attacks and assessing the efforts for developing quantum-resilient algorithms. Quantum computers promise unprecedented computation power by harnessing the strange properties of quantum mechanics. While quantum algorithms still pose a significant threat to conventional cryptography, the emergence of post-quantum algorithms offer hope to secure our data in the quantum era

International Journal of Research and Review in Applied Science Humanities and TechnologyJan 30, 20253 citations

Post-quantum Cryptographic Approach for Cyberspace Security

J.J. Jayakanth, Vani Rajasekar, Velliangiri Sarveshwaran

The most recent quantum computers are capable of decoding secret encryption keys and opening up the network to attack by solving extremely difficult classical cryptography calculations. In contrast to the billions of years of calculation required by conventional computer equipment, they can nearly instantly solve complex mathematical calculations. The emergence of quantum computing and blockchains are two of the main technical developments both in academic and industry domains that are currently in progress. Researchers support the creation of innovative methods that incorporate encryption technology in the post-quantum computing. A lattice was utilized extensively in cryptography and those techniques were employed in both (a) cryptanalysis by utilizing lattice assumption to crack cryptosystems and (b) cryptography by exploiting challenging lattice problems in computational domain. The issues similar to the quantum attack and the execution of post-quantum signature verification in blockchains are a required scientific implementation in today’s world because blockchains have considerably advanced in recent years and learned numerous applications in various fields with the assumption that they will significantly improve their security. This chapter offers the theoretical underpinnings for current research in post-quantum cryptography that aims to integrate safe cryptographic primitives into blockchain technology.

River Publishers eBooksAug 23, 20242 citations