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

International Insurance Law Review

Quantum Cryptanalysis: A Survey of Threats and Post-Quantum Countermeasures

Raja Shree, Bhuvan Unhelkar, Siva Shankar, Nagarajan

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Quantum computing will revolutionize the power of computation, solving problems that currently have no solution classically. Such a jump in computational power presents an existential threat to modern cryptography, particularly public-key systems that rely on factoring and discrete logarithmic problems. This paper presents the emerging area of PQC countermeasures and gives a survey of quantum cryptanalysis methods. A literature review of progress from 2010 to 2025 is also provided, specifically addressing the advancement of algorithms, standards and applications. For universal security of data in the quantum age, they add, it will be critical to transition to quantum-resistant infrastructures.

DOI
10.65677/iilr.34.s1.20

Related papers

QUANTUM CRYPTANALYSIS

Amos R Anu Gowda

The advent of quantum computing poses an existential threat to classical cryptographic systems. Shor’s algorithm (1994) can factor large integers and compute discrete logarithms in polynomial time, breaking widely used schemes like RSA, ECC, and Diffie-Hellman. This paper surveys the state-of-the-art in quantum cryptanalysis, examining its impact on symmetric and asymmetric cryptography, recent progress in quantum attacks, and defenses via post-quantum cryptography (PQC). We analyze key quantum algorithms (Shor’s, Grover’s), their real-world feasibility given current hardware (NISQ-era limitations), and emerging PQC standards (NIST’s CRYSTALS-Kyber, Dilithium). We also discuss novel attack vectors (e.g., hybrid quantum-classical cryptanalysis) and future research directions.

Archives The Journal of the British Records Association•Jul 31, 2025•0 citations

Quantum Resistant Cryptography and Cyberwarfare

William Easttom

Quantum computing poses a significant threat to conventional cryptographic systems that rely on the difficulty of mathematical problems such as integer factorization and discrete logarithms. These systems underpin much of the current security infrastructure, including public key cryptography and digital signatures. As quantum computers approach practical viability, there is an urgent need to transition to quantum-resistant cryptographic solutions that can secure digital communications against adversaries equipped with quantum capabilities. This paper explores the landscape of quantum-resistant cryptography, focusing on those algorithms that have emerged either as standards or as leading algorithm. Furthermore, the paper examines the progress of standardization efforts, such as the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) initiative, and the implications of deploying these algorithms in existing systems. By addressing the practical considerations for adoption, this study aims to provide a comprehensive overview of the current state and future directions of quantum-resistant cryptography, ensuring robust security in a post-quantum world.

International Conference on Cyber Warfare and Security•Mar 24, 2025•1 citation

A Review of the Post-Quantum Cryptographic Landscape

Devyansh Lilaramani

As the development of quantum computing systems advances, the integrity of current public-key and symmetrickey cryptographic systems, such as RSA, ECC, and AES, faces unprecedented threats.These systems rely on mathematical problems like integer factorization and discrete logarithms, which quantum algorithms like Shor's can solve exponentially faster than classical ones.This review examines the vulnerability of widely used cryptographic systems and evaluates how close quantum hardware is to breaching real-world encryption.It also discusses the development of post-quantum cryptographic algorithms, specifically lattice-based, code-based, and multivariate polynomial systems designed to resist quantum attacks.This paper will also assess the strengths, limitations, and standardization progress of these post-quantum solutions to provide an understanding of the modern cryptographic landscape.

International journal of high school research•Jun 30, 2026•0 citations

Review of Quantum Computing Advances and their Impact on Modern Cryptographic Security

Niravkumar Prajapati

Quantum computing is poised to revolutionize numerous sectors, with cryptographic security identified as one of the most critically affected domains. For instance, Elliptic Curve Cryptography (ECC) and RSA, two traditional encryption techniques, rely on the computational difficulty of integer factorization and discrete logarithms. Nevertheless, quantum algorithms, particularly Shor's algorithm, which jeopardizes the security of existing cryptographic systems, may be able to address these problems successfully. This discovery necessitates the development of cryptographic techniques that are impervious to quantum attacks. The study of post-quantum cryptography (PQC), which includes hash-based, lattice-based, and other quantum-resistant algorithms, is becoming essential to ensuring the long-term confidentiality and integrity of data. This paper explores the basic concepts of quantum computing, their relationship to cryptographic privacy, and potential solutions for the associated security problems in the quantum age.

•May 29, 2025•7 citations

Post Quantum Cryptography

Kirandeep Kaur, Arwinderjit Kaur, Manmeet Kaur

The increasing advancement in quantum computing threatens the security of traditional cryptographic systems that underpin much of the modern world’s data protection. These systems rely heavily on the computational difficulty of problems like integer factorization (RSA) and elliptic curve discrete logarithms (ECC), which quantum computers could solve in polynomial time. As a result, there is an urgent need for cryptographic systems that remain secure even in the presence of quantum capabilities. Post-Quantum Cryptography (PQC) is the emerging field that aims to develop cryptographic protocols resistant to quantum-based attacks. This paper discusses the need for PQC, explores various candidate algorithms, reviews standardization efforts, and looks at the current challenges and future directions in the field.

•Jan 1, 2026•0 citations

Post-Quantum Cryptography for Secure Communication: A Systematic Review of Algorithms, Performance Trade-offs, and Emerging Challenges

Suvhodip Saha

The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.

International Journal for Research in Applied Science and Engineering Technology•Mar 24, 2026•0 citations
Quantum computing will revolutionize the power of computation, solving problems that currently have no solution classically. Such a jump in computational power presents an existential threat to modern cryptography, particularly public-key systems that rely on factoring and discrete logarithmic problems. This paper presents the emerging area of PQC countermeasures and gives a survey of quantum cryptanalysis methods. A literature review of progress from 2010 to 2025 is also provided, specifically addressing the advancement of algorithms, standards and applications. For universal security of data in the quantum age, they add, it will be critical to transition to quantum-resistant infrastructures.
The advent of quantum computing poses an existential threat to classical cryptographic systems. Shor’s algorithm (1994) can factor large integers and compute discrete logarithms in polynomial time, breaking widely used schemes like RSA, ECC, and Diffie-Hellman. This paper surveys the state-of-the-art in quantum cryptanalysis, examining its impact on symmetric and asymmetric cryptography, recent progress in quantum attacks, and defenses via post-quantum cryptography (PQC). We analyze key quantum algorithms (Shor’s, Grover’s), their real-world feasibility given current hardware (NISQ-era limitations), and emerging PQC standards (NIST’s CRYSTALS-Kyber, Dilithium). We also discuss novel attack vectors (e.g., hybrid quantum-classical cryptanalysis) and future research directions.
Quantum computing poses a significant threat to conventional cryptographic systems that rely on the difficulty of mathematical problems such as integer factorization and discrete logarithms. These systems underpin much of the current security infrastructure, including public key cryptography and digital signatures. As quantum computers approach practical viability, there is an urgent need to transition to quantum-resistant cryptographic solutions that can secure digital communications against adversaries equipped with quantum capabilities. This paper explores the landscape of quantum-resistant cryptography, focusing on those algorithms that have emerged either as standards or as leading algorithm. Furthermore, the paper examines the progress of standardization efforts, such as the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) initiative, and the implications of deploying these algorithms in existing systems. By addressing the practical considerations for adoption, this study aims to provide a comprehensive overview of the current state and future directions of quantum-resistant cryptography, ensuring robust security in a post-quantum world.
As the development of quantum computing systems advances, the integrity of current public-key and symmetrickey cryptographic systems, such as RSA, ECC, and AES, faces unprecedented threats.These systems rely on mathematical problems like integer factorization and discrete logarithms, which quantum algorithms like Shor's can solve exponentially faster than classical ones.This review examines the vulnerability of widely used cryptographic systems and evaluates how close quantum hardware is to breaching real-world encryption.It also discusses the development of post-quantum cryptographic algorithms, specifically lattice-based, code-based, and multivariate polynomial systems designed to resist quantum attacks.This paper will also assess the strengths, limitations, and standardization progress of these post-quantum solutions to provide an understanding of the modern cryptographic landscape.
Quantum computing is poised to revolutionize numerous sectors, with cryptographic security identified as one of the most critically affected domains. For instance, Elliptic Curve Cryptography (ECC) and RSA, two traditional encryption techniques, rely on the computational difficulty of integer factorization and discrete logarithms. Nevertheless, quantum algorithms, particularly Shor's algorithm, which jeopardizes the security of existing cryptographic systems, may be able to address these problems successfully. This discovery necessitates the development of cryptographic techniques that are impervious to quantum attacks. The study of post-quantum cryptography (PQC), which includes hash-based, lattice-based, and other quantum-resistant algorithms, is becoming essential to ensuring the long-term confidentiality and integrity of data. This paper explores the basic concepts of quantum computing, their relationship to cryptographic privacy, and potential solutions for the associated security problems in the quantum age.
The increasing advancement in quantum computing threatens the security of traditional cryptographic systems that underpin much of the modern world’s data protection. These systems rely heavily on the computational difficulty of problems like integer factorization (RSA) and elliptic curve discrete logarithms (ECC), which quantum computers could solve in polynomial time. As a result, there is an urgent need for cryptographic systems that remain secure even in the presence of quantum capabilities. Post-Quantum Cryptography (PQC) is the emerging field that aims to develop cryptographic protocols resistant to quantum-based attacks. This paper discusses the need for PQC, explores various candidate algorithms, reviews standardization efforts, and looks at the current challenges and future directions in the field.
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.