aqora

CRYPTOGRAPHIC ALGORITHMS ON THE WAY TO POST-QUANTUM CRYPTOGRAPHY

Pavel Nikolaevich Nasedkin, Vladimir Aleksandrovich Sverkunov

Information Technology and Mathematical Modeling in the Management of Complex SystemsJan 1, 20220 citations

Post-quantum Cryptography: An Overview

Syed Ismail Abdul Lathif, Priya Saxena, Priyanshi Singh

Blockchain technologiesJan 1, 20250 citations

QUANTUM COMPUTING AS A THREAT TO MODERN CRYPTOGRAPHY. AN OVERVIEW OF SHOR'S ALOHORHYTHM AND POST-QUANTUM CRYPTOGRAPHY

A. Tyunina, A. Shpineva

The article is devoted to the study of the threat of the development of quantum computing for classical cryptographic systems vulnerable to the Shor algorithm. It is shown that the RSA and ECC protocols lose their stability with the advent of scalable quantum computers, while post-quantum lattice and code schemes demonstrate high stability. It is concluded that there is a need to move to post-quantum standards and develop hybrid cryptosystems.

All-Russian Scientific and Practical Conference «Challenging Issues in Systems Modeling and Processes»Jan 15, 20260 citations

Post Quantum Cryptography Algorithms: A Review and Applications

Bikram Paul, Gaurav Trivedi

Lecture notes in networks and systemsJan 1, 20237 citations

Post-Quantum Cryptography Algorithms

Safa Mohamed , Safa Mostafa , Safa Kamal

Jul 25, 20260 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.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

AN OVERVIEW OF PROMISING POST-QUANTUM CRYPTOGRAPHY ALGORITHMS

Related papers

AN OVERVIEW OF PROMISING POST-QUANTUM CRYPTOGRAPHY ALGORITHMS

Related papers