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

CRC Press eBooks

Cryptography and Quantum

Timur Qader

Published Dec 16, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1201/9781003685746-4

Related papers

Post‐Quantum Cryptography Methods

M. Kundalakesi, M. Renuka Devi

The rise of powerful quantum computers casts a long shadow over the world of cryptography. Traditional encryption methods, both symmetrical and asymmetrical, are facing an existential crisis. Algorithms like Grover's search pose a significant threat to symmetric systems like AES and 3DES, dramatically accelerating key discovery. Asymmetric algorithms, like RSA, Diffie–Hellman, and ECC, rely on the inherent difficulty of factoring large numbers and solving discrete logarithms. While classical algorithms struggle with these problems, Shor's factoring algorithm, designed for quantum computers, can solve them efficiently. This impending obsolescence of current cryptographic systems necessitates a proactive search for new solutions—post-quantum cryptography. This new era of cryptography demands a deep exploration of various post-quantum cryptosystem families. National and international organizations, like the NIST (National Institute of Standards and Technology) in the US, are actively involved in the standardization process for these new encryption methods. The urgency to develop and implement post-quantum cryptography stems from the inherent vulnerabilities of classical encryption systems when faced with the brute force of quantum computing. However, the story does not end there. The future holds the potential for a powerful synergy between the immense computational power of quantum computers and the strategic decision-making capabilities of artificial intelligence. By combining these two revolutionary technologies, industries can unlock a new level of optimization, innovation, and efficiency. This future, however, hinges on securing our communication channels with robust post-quantum cryptography, ensuring a safe and secure foundation for this technological leap forward.

Wiley eBooks•Mar 7, 2025•4 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

Securing the Future: A Comprehensive Review of Post-Quantum Cryptography in the Modern Threat Landscape

Nodira Rustamovna Rustamova, S. Dutta

The accelerating development of quantum computing represents one of the most significant paradigm shifts in the history of information security. Cryptographic systems that currently underpin global digital infrastructure—including RSA, Diffie–Hellman, and Elliptic Curve Cryptography—rely on mathematical assumptions that collapse under quantum algorithms such as Shor’s and Grover’s. Post-Quantum Cryptography (PQC) emerges as the most viable and immediate solution to secure communications in the quantum era, offering cryptographic primitives that can be deployed on today’s classical hardware while resisting both classical and quantum attacks. This review provides a comprehensive, detailed examination of PQC, analyzing its mathematical foundations, algorithmic families, standardization progress, and deployment challenges. Special emphasis is placed on the NIST PQC standardization process, the risk posed by “harvest-now-decrypt-later” adversaries, the complexities of global cryptographic migration, and the implications for critical digital infrastructures such as cloud computing, blockchain systems, long-lifespan data archives, IoT ecosystems, and national cybersecurity. Through standalone equations, tables, and figures—including a conceptual visual provided by the user—this paper offers a complete, cohesive, and rigorous synthesis. The findings underscore that the transition to PQC is not optional but imperative, requiring coordinated scientific, governmental, and industrial effort to safeguard the digital future.

Qubahan Techno Journal•May 25, 2025•4 citations

Quantum-Prone Security Weaknesses and Remediation

Timur Qader

This chapter identifies quantum threats to modern cryptographic systems and outlines mitigation strategies. It classifies vulnerabilities by cryptographic type: asymmetric (broken by Shor's algorithm), symmetric (weakened by Grover's algorithm), and digital signatures. It emphasizes risks such as compromised software updates, blockchain manipulation, and the “harvest now, decrypt later” threat. The chapter reviews national and international roadmaps by NIST, NSA, ETSI, WEF, and ENISA, highlighting timelines for inventory, migration, and validation. It presents case studies from Google, Microsoft, IBM, and others piloting post-quantum cryptography. Recommended remediation includes inventorying cryptographic assets, adopting hybrid schemes, and implementing crypto-agile infrastructure. A proposed “quantum-safe stack” aligns resilient algorithms (e.g., CRYSTALS-Kyber, Dilithium, AES-256) with key security tasks. The chapter concludes with practical checklists and a phased roadmap for organizations to begin immediate planning and transition, recognizing a multi-year effort is needed to achieve post-quantum readiness before full-scale quantum computing becomes operational.

CRC Press eBooks•Dec 16, 2025•0 citations

Quantum cryptography and security

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

With the rapid evolution of quantum computing, modern cryptographic systems face an unprecedented challenge to their foundational security. Classical encryption schemes such as RSA, elliptic curve cryptography, and Diffie–Hellman, once considered robust, are now vulnerable to quantum algorithms capable of breaking them in polynomial time. This emerging threat necessitates a paradigm shift toward quantum-safe or post-quantum cryptography—techniques designed to remain secure against both classical and quantum adversaries. Among these, hash-based cryptography has gained prominence for its simplicity and strong resistance to quantum attacks, with advanced schemes such as https://www.w3.org/1998/Math/MathML" display="inline"> SPHINCS + offering scalable and standardized digital signature solutions. However, issues such as increased signature sizes, high computational costs, and complex key management remain active research challenges. This chapter explores the scope and objectives of quantum cryptography and post-quantum mechanisms, presenting a comparative study between classical and quantum systems, analyzing key distribution protocols such as BB84 and E91, and discussing emerging post-quantum cryptography algorithms standardized by the National Institute of Standards and Technology. It also addresses ethical, regulatory, and implementation concerns surrounding the transition to a quantum-secure digital infrastructure. The analysis concludes that a hybrid cryptographic framework, integrating classical resilience with quantum-based security principles, offers the most pragmatic path toward sustaining digital trust in the quantum era.

CRC Press eBooks•Nov 6, 2026•0 citations

Quantum‐Safe Cryptography and Future‐Proofing Security

Hewa Majeed Zangana

As quantum computing develops, great revolutionary opportunities and tremendous existential threats urge the need for a change. Traditional encryption algorithms—namely, Rivest–Shamir–Adleman (RSA), Elliptic Curve Cryptography, Diffie–Hellman key exchange—are prone to quantum attacks. Therefore, building quantum-safe cryptography has become the foremost global security challenge. This chapter analyzes the development of quantum-safe cryptography based on post-quantum algorithms such as lattice systems, multivariate polynomial cryptography, hash-based signatures, and code-based encryption. It examines how these cryptographic notions are intended to offer data security in the classical and quantum realms while being able to operate efficiently and interoperate with current digital systems. Possible strategies toward quantum-safe systems are outlined concerning hybrid models for cryptographic implementations, National Institute of Standards and Technology (NIST's) standardization efforts, and real-time integration of artificial intelligence methods for dynamically adjusting the security frameworks in view of adversarial quantum situations. A comprehensive and definitive study of the current advancements, difficulties, and pathways for implementation underlines how organizations can prepare for lasting resilience in the quantum era in security architectures that are scalable and adaptive.

Wiley eBooks•Jul 3, 2026•0 citations
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.
The rise of powerful quantum computers casts a long shadow over the world of cryptography. Traditional encryption methods, both symmetrical and asymmetrical, are facing an existential crisis. Algorithms like Grover's search pose a significant threat to symmetric systems like AES and 3DES, dramatically accelerating key discovery. Asymmetric algorithms, like RSA, Diffie–Hellman, and ECC, rely on the inherent difficulty of factoring large numbers and solving discrete logarithms. While classical algorithms struggle with these problems, Shor's factoring algorithm, designed for quantum computers, can solve them efficiently. This impending obsolescence of current cryptographic systems necessitates a proactive search for new solutions—post-quantum cryptography. This new era of cryptography demands a deep exploration of various post-quantum cryptosystem families. National and international organizations, like the NIST (National Institute of Standards and Technology) in the US, are actively involved in the standardization process for these new encryption methods. The urgency to develop and implement post-quantum cryptography stems from the inherent vulnerabilities of classical encryption systems when faced with the brute force of quantum computing. However, the story does not end there. The future holds the potential for a powerful synergy between the immense computational power of quantum computers and the strategic decision-making capabilities of artificial intelligence. By combining these two revolutionary technologies, industries can unlock a new level of optimization, innovation, and efficiency. This future, however, hinges on securing our communication channels with robust post-quantum cryptography, ensuring a safe and secure foundation for this technological leap forward.
“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.
The accelerating development of quantum computing represents one of the most significant paradigm shifts in the history of information security. Cryptographic systems that currently underpin global digital infrastructure—including RSA, Diffie–Hellman, and Elliptic Curve Cryptography—rely on mathematical assumptions that collapse under quantum algorithms such as Shor’s and Grover’s. Post-Quantum Cryptography (PQC) emerges as the most viable and immediate solution to secure communications in the quantum era, offering cryptographic primitives that can be deployed on today’s classical hardware while resisting both classical and quantum attacks. This review provides a comprehensive, detailed examination of PQC, analyzing its mathematical foundations, algorithmic families, standardization progress, and deployment challenges. Special emphasis is placed on the NIST PQC standardization process, the risk posed by “harvest-now-decrypt-later” adversaries, the complexities of global cryptographic migration, and the implications for critical digital infrastructures such as cloud computing, blockchain systems, long-lifespan data archives, IoT ecosystems, and national cybersecurity. Through standalone equations, tables, and figures—including a conceptual visual provided by the user—this paper offers a complete, cohesive, and rigorous synthesis. The findings underscore that the transition to PQC is not optional but imperative, requiring coordinated scientific, governmental, and industrial effort to safeguard the digital future.
This chapter identifies quantum threats to modern cryptographic systems and outlines mitigation strategies. It classifies vulnerabilities by cryptographic type: asymmetric (broken by Shor's algorithm), symmetric (weakened by Grover's algorithm), and digital signatures. It emphasizes risks such as compromised software updates, blockchain manipulation, and the “harvest now, decrypt later” threat. The chapter reviews national and international roadmaps by NIST, NSA, ETSI, WEF, and ENISA, highlighting timelines for inventory, migration, and validation. It presents case studies from Google, Microsoft, IBM, and others piloting post-quantum cryptography. Recommended remediation includes inventorying cryptographic assets, adopting hybrid schemes, and implementing crypto-agile infrastructure. A proposed “quantum-safe stack” aligns resilient algorithms (e.g., CRYSTALS-Kyber, Dilithium, AES-256) with key security tasks. The chapter concludes with practical checklists and a phased roadmap for organizations to begin immediate planning and transition, recognizing a multi-year effort is needed to achieve post-quantum readiness before full-scale quantum computing becomes operational.
With the rapid evolution of quantum computing, modern cryptographic systems face an unprecedented challenge to their foundational security. Classical encryption schemes such as RSA, elliptic curve cryptography, and Diffie–Hellman, once considered robust, are now vulnerable to quantum algorithms capable of breaking them in polynomial time. This emerging threat necessitates a paradigm shift toward quantum-safe or post-quantum cryptography—techniques designed to remain secure against both classical and quantum adversaries. Among these, hash-based cryptography has gained prominence for its simplicity and strong resistance to quantum attacks, with advanced schemes such as https://www.w3.org/1998/Math/MathML" display="inline"> SPHINCS + offering scalable and standardized digital signature solutions. However, issues such as increased signature sizes, high computational costs, and complex key management remain active research challenges. This chapter explores the scope and objectives of quantum cryptography and post-quantum mechanisms, presenting a comparative study between classical and quantum systems, analyzing key distribution protocols such as BB84 and E91, and discussing emerging post-quantum cryptography algorithms standardized by the National Institute of Standards and Technology. It also addresses ethical, regulatory, and implementation concerns surrounding the transition to a quantum-secure digital infrastructure. The analysis concludes that a hybrid cryptographic framework, integrating classical resilience with quantum-based security principles, offers the most pragmatic path toward sustaining digital trust in the quantum era.
As quantum computing develops, great revolutionary opportunities and tremendous existential threats urge the need for a change. Traditional encryption algorithms—namely, Rivest–Shamir–Adleman (RSA), Elliptic Curve Cryptography, Diffie–Hellman key exchange—are prone to quantum attacks. Therefore, building quantum-safe cryptography has become the foremost global security challenge. This chapter analyzes the development of quantum-safe cryptography based on post-quantum algorithms such as lattice systems, multivariate polynomial cryptography, hash-based signatures, and code-based encryption. It examines how these cryptographic notions are intended to offer data security in the classical and quantum realms while being able to operate efficiently and interoperate with current digital systems. Possible strategies toward quantum-safe systems are outlined concerning hybrid models for cryptographic implementations, National Institute of Standards and Technology (NIST's) standardization efforts, and real-time integration of artificial intelligence methods for dynamically adjusting the security frameworks in view of adversarial quantum situations. A comprehensive and definitive study of the current advancements, difficulties, and pathways for implementation underlines how organizations can prepare for lasting resilience in the quantum era in security architectures that are scalable and adaptive.