Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in networks and systems

The Theoretical Rationale for Using Quantum Computers to Crack Cryptosystems

Yulia Andrusenko, Dmitry Lukyanov, Alexey Dmitrienko, A. A. Kushchenko, Diana Fedash

Published Nov 17, 2025• 0 citations
Publisher
DOI
10.1007/978-3-032-07275-7_4

Related papers

Review of quantum theories for the design of post-quantum cryptosystems: CRYSTALS-Kyber as a case study

Yaser Alkurdi, Qasem S. Abu Al-Haija, Mustafa A. Al-Fayoumi

Powerful new computers based on the principles of quantum mechanics could crack the codes that safeguard our information today. The National Institute of Standards and Technology is running a competition to find more secure encryption methods to address this future challenge. CRYSTALS-Kyber is a messaging scramble Algorithm built with a complex structure called a lattice. This design is considered secure against powerful quantum computers because there is no known shortcut for them to break the code efficiently, unlike some other classical encryption Algorithms. In this paper, we introduce primitive information about quantum characteristics, computation, and main gate circuits, as well as the quantum theories for the design of post-quantum cryptosystems. Then, we listed the main key players in the quantum field and their achievements. We also compared the programming platforms used in developing programs in a quantum environment. Finally, we focused on cryptography applications and showed some of the mathematics background required to build knowledge for post-quantum cryptography algorithms, especially the CRYSTALS-Kyber algorithms and its core block Number Theoretic Transformation (NTT).

IET conference proceedings.•Mar 1, 2025•2 citations

Key Insights on the Use of Quantum Computing in Breaking Cryptographic Algorithms

Khemant Nirvaan Degambur, Girish Bekaroo

Progress in IS•Jan 1, 2026•0 citations

Exploring Shor's Algorithm in Cracking RSA Encryption

Aashutosh Srivastava

The present study explores the groundbreaking possibilities of Shor's algorithm in cracking RSA encryption, hence enhancing the security consequences of this extensively employed cryptographic protocol. Due to Shor's algorithm's exponential speed advantage over classical algorithms, RSA encryption—a popular public key cryptosystem—is vulnerable to quantum attacks. To keep its security, RSA depends on the difficulty of factoring huge semi-primes. RSA's security presumptions are called into question by Shor's algorithm's quick factorization on a quantum computer, which has prompted research into post-quantum cryptography solutions to guarantee secure communication in the quantum age. Even with parallel computation, the speed and storage capacity of classical computing are constrained. A key idea in quantum computing is quantum parallelism, which allows quantum systems to carry out several computations at once. In contrast to classical portions. The scope of this paper is to understand the fundamentals of Quantum Computing, the current state of Shor’s algorithm implementation, and efficiency, particularly its application in compromising public key cryptosystems like RSA. The project aims to achieve how factorization is done through classical methods and further, how is this done through Shor’s algorithm and QFT techniques.

International Journal of Sciences: Basic and Applied Research•Nov 15, 2024•0 citations

Threats Posed by Quantum Computers to State-of-the-Art Encryption Schemes

Rajiv Krishnakumar

•Jan 1, 2025•1 citation

Toward quantum computer resistant cryptographic schemes

真吾 長谷川

•Jan 1, 2009•0 citations

Mitigating Quantum Threats: A Hybrid Cryptographic Framework For Secure Data Protection In The Quantum Era

Pratham Barve, Shounak Sugave

Quantum computing provides an imminent threat to conventional cryptographic schemes; algorithms run on quantum computers directly risk the public encryption keys used in these types of cryptosystems. In this paper, we present a hybrid cryptosystem that combines pre-quantum algorithms with post-quantum ones to withstand quantum assaults. We simulate conventional and quantum assaults on encrypted data and demonstrate that the suggested hybrid is more resistant to quantum threats. To ensure the model's validity, performance evaluations on time-to-crack and resource efficiency are carried out. Our findings indicate hybrid cryptography as an intermediate approach in the quantum realm.

International Journal of Environmental Sciences•Aug 11, 2025•0 citations
Powerful new computers based on the principles of quantum mechanics could crack the codes that safeguard our information today. The National Institute of Standards and Technology is running a competition to find more secure encryption methods to address this future challenge. CRYSTALS-Kyber is a messaging scramble Algorithm built with a complex structure called a lattice. This design is considered secure against powerful quantum computers because there is no known shortcut for them to break the code efficiently, unlike some other classical encryption Algorithms. In this paper, we introduce primitive information about quantum characteristics, computation, and main gate circuits, as well as the quantum theories for the design of post-quantum cryptosystems. Then, we listed the main key players in the quantum field and their achievements. We also compared the programming platforms used in developing programs in a quantum environment. Finally, we focused on cryptography applications and showed some of the mathematics background required to build knowledge for post-quantum cryptography algorithms, especially the CRYSTALS-Kyber algorithms and its core block Number Theoretic Transformation (NTT).
The present study explores the groundbreaking possibilities of Shor's algorithm in cracking RSA encryption, hence enhancing the security consequences of this extensively employed cryptographic protocol. Due to Shor's algorithm's exponential speed advantage over classical algorithms, RSA encryption—a popular public key cryptosystem—is vulnerable to quantum attacks. To keep its security, RSA depends on the difficulty of factoring huge semi-primes. RSA's security presumptions are called into question by Shor's algorithm's quick factorization on a quantum computer, which has prompted research into post-quantum cryptography solutions to guarantee secure communication in the quantum age. Even with parallel computation, the speed and storage capacity of classical computing are constrained. A key idea in quantum computing is quantum parallelism, which allows quantum systems to carry out several computations at once. In contrast to classical portions. The scope of this paper is to understand the fundamentals of Quantum Computing, the current state of Shor’s algorithm implementation, and efficiency, particularly its application in compromising public key cryptosystems like RSA. The project aims to achieve how factorization is done through classical methods and further, how is this done through Shor’s algorithm and QFT techniques.
Quantum computing provides an imminent threat to conventional cryptographic schemes; algorithms run on quantum computers directly risk the public encryption keys used in these types of cryptosystems. In this paper, we present a hybrid cryptosystem that combines pre-quantum algorithms with post-quantum ones to withstand quantum assaults. We simulate conventional and quantum assaults on encrypted data and demonstrate that the suggested hybrid is more resistant to quantum threats. To ensure the model's validity, performance evaluations on time-to-crack and resource efficiency are carried out. Our findings indicate hybrid cryptography as an intermediate approach in the quantum realm.