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

Wiley eBooks

Understanding Classical and Post‐Quantum Cryptography and Solutions

Jai Singh Arun, Ray Harishankar, Walid Rjaib

Published Sep 19, 2025• 0 citations
Publisher

Abstract

This chapter reviews classical cryptography and its applications, and shows which subset thereof is vulnerable to attacks leveraging a cryptographically relevant quantum computer. Symmetric algorithms, asymmetric algorithms, hashing algorithms, digital signatures, digital certificates, and certificate authorities are the building blocks on which solutions to real-world security problems are built. The chapter describes three key examples where these building blocks are put to work: code signing, secure communication, and data-at-rest encryption. It explores the looming threat posed by quantum computers, particularly their ability to break widely used asymmetric cryptography via Shor's algorithm while also weakening symmetric cryptography and hashing through Grover's algorithm. The chapter contrasts post-quantum cryptography with other quantum-safe technologies such as quantum key distribution and quantum random number generators, highlighting their distinct roles and deployment implications.

DOI
10.1002/9781394406784.ch3

Related papers

Cryptography and Quantum

Timur Qader

This chapter explains the evolution and future risks to cryptography from quantum computing. It outlines key historical developments from ancient ciphers through World War II (WWII) innovations like Enigma and Colossus, to modern symmetric and asymmetric encryption systems. It highlights RSA, Diffie-Hellman, and AES, and introduces digital certificates and HTTPS protocols. The chapter then shifts to the quantum threat, explaining how Shor's algorithm breaks asymmetric encryption and Grover's weakens symmetric methods. It details the “harvest now, decrypt later” risk, emphasizing the urgency of post-quantum cryptography. NIST's efforts to standardize quantum-resistant algorithms are noted. The chapter concludes with a breakdown of symmetric, asymmetric, and hash-based cryptographic methods, their applications, and quantum-era challenges. The focus is on the need for proactive migration strategies and resilient cryptographic frameworks before quantum systems become practically deployable, potentially by 2030. The chapter serves as a foundational guide for understanding and responding to the quantum disruption of cryptographic security.

CRC Press eBooks•Dec 16, 2025•0 citations

Cryptographic Implications of Quantum Computing

Bhupendra Singh, Mohankumar Mylsamy, Thamaraimanalan Thangarajan

“Cryptographic Implications of Quantum Computing” explores the significant impact quantum computing will have on modern cryptographic systems. Cryptography is essential for maintaining confidentiality, integrity, and authenticity in digital communications, safeguarding critical infrastructure, and building trust in the digital economy. As quantum computing advances, traditional cryptographic systems will face new challenges. Also this chapter examines Shor's Algorithm, which poses a major threat to RSA and Elliptic Curve Cryptography (ECC) by enabling quantum computers to efficiently solve the prime factorization and discrete logarithm problems, breaking these widely used public key cryptosystems. The potential of Grover's Algorithm is also discussed, highlighting its ability to speed up brute-force attacks on symmetric encryption systems like AES, halving the security of traditional symmetric-key algorithms. To mitigate these threats, the chapter suggests adopting AES-256 or longer key lengths, which are more resistant to quantum attacks, and recommends shifting to quantum-resistant algorithms for both symmetric and asymmetric encryptions. However, practical considerations, such as increased computational overhead and the challenges of transitioning to new systems, are also explored. The vulnerabilities of classical cryptographic systems particularly public-key methods like RSA and ECC, and symmetric key algorithms like AES and DES are examined in light of the capabilities of quantum computers. As quantum computing progresses, it is crucial for organizations and governments to adapt and adopt post-quantum cryptography to ensure data security in the quantum era. The chapter emphasizes the need for a proactive approach to protect sensitive information against the emerging quantum threats.

CRC Press eBooks•Nov 14, 2025•0 citations

Quantum Computing in Cryptographic Systems

Robin Cyriac, Sivaraman Eswaran, Shitharth Selvarajan

Quantum computing represents a transformative advancement in computational power, with profound implications for cryptographic systems. This paper explores the intersection of quantum computing and cryptography, examining the potential for quantum computers to both break traditional cryptographic algorithms and enable new forms of secure communication. Classical cryptographic systems, such as RSA and ECC, rely on the computational difficulty of problems like integer factorization and discrete logarithms. However, quantum algorithms, notably Shor's algorithm, can solve these problems exponentially faster than the best-known classical algorithms, posing a significant threat to the security of current cryptographic practices. This vulnerability necessitates the development and implementation of quantum-resistant algorithms to ensure data security in a post-quantum world. The paper reviews the state-of-the-art in quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. These algorithms are analyzed for their security properties, efficiency, and practicality for real-world deployment. Additionally, the paper discusses the ongoing standardization efforts led by organizations such as NIST, which are crucial for establishing widely accepted quantum-safe cryptographic protocols. Beyond the threat posed by quantum computing, this paper also highlights the potential benefits quantum computing can bring to cryptographic systems. Quantum Key Distribution (QKD) is one such advancement, offering theoretically unbreakable encryption by leveraging the principles of quantum mechanics. QKD enables secure communication channels that are immune to any computational advances, including those of quantum computers, by ensuring that any attempt at eavesdropping can be detected. The practical implementation challenges of QKD and other quantum cryptographic protocols are also addressed, including issues related to transmission distance, error rates, and integration with existing communication infrastructures. Experimental results from recent QKD trials are presented, showcasing significant progress in extending the viability of quantum-secure communication over long distances. Furthermore, the paper delves into the hybrid approaches combining classical and quantum cryptographic techniques. These approaches aim to leverage the strengths of both paradigms to enhance security and performance. For instance, hybrid protocols might use classical encryption for bulk data transfer, supplemented by quantum techniques for key exchange, thereby ensuring robust security even against future quantum adversaries. In conclusion, while quantum computing poses substantial risks to existing cryptographic systems, it also offers novel opportunities for creating highly secure communication protocols. The transition to quantum-safe cryptography is imperative to protect sensitive information in the quantum era. This paper underscores the urgency of advancing quantum-resistant cryptographic research, promoting international collaboration for standardization, and exploring innovative applications of quantum technologies in cryptography. Continued research and development in these areas are essential to stay ahead of the evolving threat landscape and harness the full potential of quantum computing for secure communications.

•Jan 1, 2024•8 citations

Rethinking Security: Cryptography in the Age of Quantum Computing

John Olusegun Fajinmi

The advent of quantum computing poses a paradigm-shifting threat to classical cryptographic systems that underpin global digital security. As quantum processors advance towards practical scalability, previously secure encryption schemesparticularly those based on integer factorization (e.g., RSA) and discrete logarithm problems (e.g., ECC and DH)-are rendered vulnerable due to quantum algorithms like Shor's and Grover's. This paper critically examines the implications of quantum computing for contemporary cryptographic frameworks and explores the urgent need to transition toward quantum-resistant alternatives. We begin by analyzing the computational capabilities of quantum systems and their impact on symmetric and asymmetric cryptographic algorithms. The study delves into the principles of postquantum cryptography (PQC), including lattice-based, hash-based, code-based, multivariate polynomial, and supersingular isogeny cryptography, evaluating their strengths, implementation challenges, and resistance to quantum attacks. Additionally, we assess ongoing global initiatives such as NIST's post-quantum cryptography standardization project, highlighting their role in shaping future security infrastructures. The paper also considers hybrid cryptographic models and quantum key distribution (QKD) as transitional and long-term security strategies. By rethinking security from both theoretical and practical standpoints, this study emphasizes the need for immediate and collaborative action across academia, industry, and government sectors to future-proof digital communication systems against the looming quantum threat.

•Apr 17, 2025•0 citations

How quantum breaks encryption

Walt Powell

This chapter explores the cryptographic implications of quantum computing, offering a detailed yet accessible breakdown of how quantum systems fundamentally differ from classical ones and why that difference threatens modern digital security. It introduces key quantum concepts such as superposition and parallelism, and explains how these capabilities enable powerful algorithms like Shor's and Grover's to solve mathematical problems that underpin today's encryption systems. The chapter compares symmetric encryption (e.g., AES) and asymmetric encryption (e.g., RSA, ECC, Diffie-Hellman), showing why public-key infrastructure (PKI) is especially vulnerable to quantum attacks. The chapter provides a clear explanation of how Shor's Algorithm breaks RSA and ECC by efficiently factoring large integers and solving discrete logarithms – problems considered infeasible for classical computers. It also examines Grover's Algorithm, which weakens symmetric encryption by reducing brute-force search times, prompting recommendations to adopt longer key lengths such as AES-256. Real-world experiments from Google's Willow processor and China's Zuchongzhi 3.0 demonstrate meaningful progress in quantum hardware, indicating that the Q-Day scenario – when cryptographically relevant quantum computers emerge – is rapidly approaching.

CRC Press eBooks•Dec 12, 2025•0 citations

Post-Quantum Cryptography: Securing Digital Communication in the Quantum Era

Mamatha, G S, Namya Dimri, Rasha Sinha

The advent of quantum computing poses a profound threat to traditional cryptographic systems, exposing vulnerabilities that compromise the security of digital communication channels reliant on RSA, ECC, and similar classical encryption methods. Quantum algorithms, notably Shor's algorithm, exploit the inherent computational power of quantum computers to efficiently solve mathematical problems underlying these cryptographic schemes. In response, post-quantum cryptography (PQC) emerged as a critical field aimed at developing resilient cryptographic algorithms impervious to quantum attacks. This paper delineates the vulnerabilities of classical cryptographic systems to quantum attacks, elucidates the principles of quantum computing, and introduces various PQC algorithms such as lattice-based cryptography, code-based cryptography, hash-based cryptography, and multivariate polynomial cryptography. Highlighting the importance of PQC in securing digital communication amidst quantum computing advancements, this research underscores its pivotal role in safeguarding data integrity, confidentiality, and authenticity in the face of emerging quantum threats.

arXiv:2403.11741•Mar 18, 2024•43 citations
This chapter reviews classical cryptography and its applications, and shows which subset thereof is vulnerable to attacks leveraging a cryptographically relevant quantum computer. Symmetric algorithms, asymmetric algorithms, hashing algorithms, digital signatures, digital certificates, and certificate authorities are the building blocks on which solutions to real-world security problems are built. The chapter describes three key examples where these building blocks are put to work: code signing, secure communication, and data-at-rest encryption. It explores the looming threat posed by quantum computers, particularly their ability to break widely used asymmetric cryptography via Shor's algorithm while also weakening symmetric cryptography and hashing through Grover's algorithm. The chapter contrasts post-quantum cryptography with other quantum-safe technologies such as quantum key distribution and quantum random number generators, highlighting their distinct roles and deployment implications.
This chapter explains the evolution and future risks to cryptography from quantum computing. It outlines key historical developments from ancient ciphers through World War II (WWII) innovations like Enigma and Colossus, to modern symmetric and asymmetric encryption systems. It highlights RSA, Diffie-Hellman, and AES, and introduces digital certificates and HTTPS protocols. The chapter then shifts to the quantum threat, explaining how Shor's algorithm breaks asymmetric encryption and Grover's weakens symmetric methods. It details the “harvest now, decrypt later” risk, emphasizing the urgency of post-quantum cryptography. NIST's efforts to standardize quantum-resistant algorithms are noted. The chapter concludes with a breakdown of symmetric, asymmetric, and hash-based cryptographic methods, their applications, and quantum-era challenges. The focus is on the need for proactive migration strategies and resilient cryptographic frameworks before quantum systems become practically deployable, potentially by 2030. The chapter serves as a foundational guide for understanding and responding to the quantum disruption of cryptographic security.
“Cryptographic Implications of Quantum Computing” explores the significant impact quantum computing will have on modern cryptographic systems. Cryptography is essential for maintaining confidentiality, integrity, and authenticity in digital communications, safeguarding critical infrastructure, and building trust in the digital economy. As quantum computing advances, traditional cryptographic systems will face new challenges. Also this chapter examines Shor's Algorithm, which poses a major threat to RSA and Elliptic Curve Cryptography (ECC) by enabling quantum computers to efficiently solve the prime factorization and discrete logarithm problems, breaking these widely used public key cryptosystems. The potential of Grover's Algorithm is also discussed, highlighting its ability to speed up brute-force attacks on symmetric encryption systems like AES, halving the security of traditional symmetric-key algorithms. To mitigate these threats, the chapter suggests adopting AES-256 or longer key lengths, which are more resistant to quantum attacks, and recommends shifting to quantum-resistant algorithms for both symmetric and asymmetric encryptions. However, practical considerations, such as increased computational overhead and the challenges of transitioning to new systems, are also explored. The vulnerabilities of classical cryptographic systems particularly public-key methods like RSA and ECC, and symmetric key algorithms like AES and DES are examined in light of the capabilities of quantum computers. As quantum computing progresses, it is crucial for organizations and governments to adapt and adopt post-quantum cryptography to ensure data security in the quantum era. The chapter emphasizes the need for a proactive approach to protect sensitive information against the emerging quantum threats.
Quantum computing represents a transformative advancement in computational power, with profound implications for cryptographic systems. This paper explores the intersection of quantum computing and cryptography, examining the potential for quantum computers to both break traditional cryptographic algorithms and enable new forms of secure communication. Classical cryptographic systems, such as RSA and ECC, rely on the computational difficulty of problems like integer factorization and discrete logarithms. However, quantum algorithms, notably Shor's algorithm, can solve these problems exponentially faster than the best-known classical algorithms, posing a significant threat to the security of current cryptographic practices. This vulnerability necessitates the development and implementation of quantum-resistant algorithms to ensure data security in a post-quantum world. The paper reviews the state-of-the-art in quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. These algorithms are analyzed for their security properties, efficiency, and practicality for real-world deployment. Additionally, the paper discusses the ongoing standardization efforts led by organizations such as NIST, which are crucial for establishing widely accepted quantum-safe cryptographic protocols. Beyond the threat posed by quantum computing, this paper also highlights the potential benefits quantum computing can bring to cryptographic systems. Quantum Key Distribution (QKD) is one such advancement, offering theoretically unbreakable encryption by leveraging the principles of quantum mechanics. QKD enables secure communication channels that are immune to any computational advances, including those of quantum computers, by ensuring that any attempt at eavesdropping can be detected. The practical implementation challenges of QKD and other quantum cryptographic protocols are also addressed, including issues related to transmission distance, error rates, and integration with existing communication infrastructures. Experimental results from recent QKD trials are presented, showcasing significant progress in extending the viability of quantum-secure communication over long distances. Furthermore, the paper delves into the hybrid approaches combining classical and quantum cryptographic techniques. These approaches aim to leverage the strengths of both paradigms to enhance security and performance. For instance, hybrid protocols might use classical encryption for bulk data transfer, supplemented by quantum techniques for key exchange, thereby ensuring robust security even against future quantum adversaries. In conclusion, while quantum computing poses substantial risks to existing cryptographic systems, it also offers novel opportunities for creating highly secure communication protocols. The transition to quantum-safe cryptography is imperative to protect sensitive information in the quantum era. This paper underscores the urgency of advancing quantum-resistant cryptographic research, promoting international collaboration for standardization, and exploring innovative applications of quantum technologies in cryptography. Continued research and development in these areas are essential to stay ahead of the evolving threat landscape and harness the full potential of quantum computing for secure communications.
The advent of quantum computing poses a paradigm-shifting threat to classical cryptographic systems that underpin global digital security. As quantum processors advance towards practical scalability, previously secure encryption schemesparticularly those based on integer factorization (e.g., RSA) and discrete logarithm problems (e.g., ECC and DH)-are rendered vulnerable due to quantum algorithms like Shor's and Grover's. This paper critically examines the implications of quantum computing for contemporary cryptographic frameworks and explores the urgent need to transition toward quantum-resistant alternatives. We begin by analyzing the computational capabilities of quantum systems and their impact on symmetric and asymmetric cryptographic algorithms. The study delves into the principles of postquantum cryptography (PQC), including lattice-based, hash-based, code-based, multivariate polynomial, and supersingular isogeny cryptography, evaluating their strengths, implementation challenges, and resistance to quantum attacks. Additionally, we assess ongoing global initiatives such as NIST's post-quantum cryptography standardization project, highlighting their role in shaping future security infrastructures. The paper also considers hybrid cryptographic models and quantum key distribution (QKD) as transitional and long-term security strategies. By rethinking security from both theoretical and practical standpoints, this study emphasizes the need for immediate and collaborative action across academia, industry, and government sectors to future-proof digital communication systems against the looming quantum threat.
This chapter explores the cryptographic implications of quantum computing, offering a detailed yet accessible breakdown of how quantum systems fundamentally differ from classical ones and why that difference threatens modern digital security. It introduces key quantum concepts such as superposition and parallelism, and explains how these capabilities enable powerful algorithms like Shor's and Grover's to solve mathematical problems that underpin today's encryption systems. The chapter compares symmetric encryption (e.g., AES) and asymmetric encryption (e.g., RSA, ECC, Diffie-Hellman), showing why public-key infrastructure (PKI) is especially vulnerable to quantum attacks. The chapter provides a clear explanation of how Shor's Algorithm breaks RSA and ECC by efficiently factoring large integers and solving discrete logarithms – problems considered infeasible for classical computers. It also examines Grover's Algorithm, which weakens symmetric encryption by reducing brute-force search times, prompting recommendations to adopt longer key lengths such as AES-256. Real-world experiments from Google's Willow processor and China's Zuchongzhi 3.0 demonstrate meaningful progress in quantum hardware, indicating that the Q-Day scenario – when cryptographically relevant quantum computers emerge – is rapidly approaching.
The advent of quantum computing poses a profound threat to traditional cryptographic systems, exposing vulnerabilities that compromise the security of digital communication channels reliant on RSA, ECC, and similar classical encryption methods. Quantum algorithms, notably Shor's algorithm, exploit the inherent computational power of quantum computers to efficiently solve mathematical problems underlying these cryptographic schemes. In response, post-quantum cryptography (PQC) emerged as a critical field aimed at developing resilient cryptographic algorithms impervious to quantum attacks. This paper delineates the vulnerabilities of classical cryptographic systems to quantum attacks, elucidates the principles of quantum computing, and introduces various PQC algorithms such as lattice-based cryptography, code-based cryptography, hash-based cryptography, and multivariate polynomial cryptography. Highlighting the importance of PQC in securing digital communication amidst quantum computing advancements, this research underscores its pivotal role in safeguarding data integrity, confidentiality, and authenticity in the face of emerging quantum threats.