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

IGI Global eBooks

Quantum-Resistant Cryptography

Ali Younis Al Maqousi, Kashinath Basu

Published May 14, 2025• 1 citation
Publisher

Abstract

The advent of quantum computing has profound implications for digital security. Traditional cryptographic methods, which currently protect online banking, secure communications, and digital asset transfers, stand at risk of obsolescence once large-scale quantum computers become a reality. This chapter offers a conceptual and theoretical exploration of quantum-resistant cryptography within the broader context of post-quantum security. It examines key theoretical frameworks underpinning cryptographic protocols, highlights the historical and contemporary debates on transitioning to post-quantum algorithms, and synthesizes existing scholarly research to identify enduring gaps. The chapter proposes new conceptual models to guide practitioners, policymakers, and researchers as they navigate the complex shift from classical cryptography to quantum-resistant techniques. By analyzing essential constructs such as lattice-based cryptography, code-based approaches, and multivariate polynomial cryptosystems, the discussion illuminates both challenges and opportunities.

DOI
10.4018/979-8-3373-1370-2.ch004

Related papers

Post-Quantum Cryptography: Preparing for the Quantum Threat

Shashikala Gurpur

Post-quantum cryptography is essential for safeguarding digital communications against the emerging threat posed by quantum computers, which can potentially break traditional cryptographic algorithms. This paper explores the vulnerabilities of current cryptographic systems to quantum attacks and examines the development of post-quantum algorithms designed to resist such threats. We analyze various candidate cryptographic schemes, including lattice-based, code-based, and multivariate polynomial cryptography, highlighting their theoretical foundations and practical implementations. Additionally, the paper discusses the challenges of transitioning to post-quantum standards, including key management and integration with existing systems.

Computer Fraud & Security•Dec 21, 2024•4 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

Quantum-Resistant Cryptographic Algorithms: A Comparative Analysis for Securing Next-Generation Communication Networks

Sagar Ramesh Rane

The advent of quantum computing poses a significant challenge to conventional cryptographic methods such as RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman key exchange. Quantum algorithms, particularly Shor’s algorithm, have the potential to break these encryption techniques, making it essential to develop cryptographic approaches that can withstand quantum threats. Post-quantum cryptography (PQC) has emerged as a crucial area of research, aiming to establish cryptographic mechanisms that remain secure even in the presence of quantum adversaries. This study presents a detailed comparative analysis of five primary categories of quantum-resistant cryptographic algorithms: lattice-based, code-based, hash-based, multivariate polynomial, and isogeny-based encryption schemes. Each of these approaches offers distinct advantages and challenges in terms of security, efficiency, and implementation feasibility. Among them, lattice-based cryptography has gained significant attention due to its robust security properties and computational efficiency, making it a strong candidate for standardization. Conversely, code-based cryptography provides high security but is hindered by its large key sizes, affecting its practical deployment. The research includes a real-time performance assessment of selected PQC algorithms, analyzing key factors such as encryption speed, key size, and computational demands. Furthermore, the study examines the challenges associated with transitioning from classical encryption standards to quantum-resistant frameworks, including compatibility constraints, computational overhead, and the necessity for global standardization. Potential mitigation approaches, such as hybrid cryptographic techniques that integrate both classical and post-quantum encryption models, are also explored. Our findings emphasize that while quantum-resistant cryptography is still evolving, early adoption of PQC frameworks is essential for safeguarding future communication networks. This paper provides valuable insights for researchers, cybersecurity professionals, and policymakers on strategic measures to implement quantum-secure encryption systems effectively.

Journal of Information Systems Engineering & Management•Feb 10, 2025•0 citations

Post-Quantum Cryptography: Preparing for the Quantum Computing Era

Dr. Raj Kumar Garg

Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.

•Aug 12, 2026•0 citations

Quantum Computing and Post-Quantum Cryptography: Challenges, Opportunities, and Future Directions for Secure Digital Systems

Shaiq Ahmad Khan, Ahmad Sajjad, Wahab Ali

The rapid development of quantum computing is one of the most transformative technological developments of the twenty-first century with profound implications for cybersecurity, digital governance and the future of secure communication systems. Traditional cryptographic infrastructures have fundamentally underpinned digital trust in banking, healthcare, defense, cloud computing, and global communication networks, but the advent of quantum computational power has led to increasing concern about the future of existing standards for encryption. This qualitative study critically examines the changing relationship between quantum computing and post-quantum cryptography through an analysis of the technological, institutional, ethical and governance challenges in the transition to quantum-secure digital systems. The study adopts an interpretivist and exploratory qualitative orientation that aims to understand how governments, cybersecurity experts, technology institutions and policy frameworks are responding to the disruptive potential of quantum technologies. Data were collected using thematic analysis of academic literature, cybersecurity policy documents, archival technological reviews, expert commentaries, institutional reports, and emerging case studies related to the development of quantum-resistant cryptography. The results show that quantum computing presents serious threats to existing public-key cryptographic systems, especially in terms of theoretical abilities of Shor’s algorithm and future quantum decryption models. Meanwhile, the paper outlines post-quantum cryptography as a vital avenue for safeguarding digital privacy, institutional credibility, and cybersecurity robustness in an ever more networked society. The analysis also points to ongoing challenges around technological readiness, regulatory uncertainty, global standardization, resource inequality and ethical issues around surveillance, privacy and digital sovereignty. Yet, the research points to the potential for secure digital transformation, resilient cybersecurity governance, and the re-inventing of future communication infrastructure through post-quantum innovation. The research finds that the transition to quantum-secure systems is not just a technological challenge, but a multidimensional governance and policy challenge requiring international cooperation, ethical foresight and proactive institutional change.

Kashmir Journal of Academic Research and Development•Jun 1, 2026•0 citations

QUANTUM COMPUTING FOR CRYPTOGRAPHY: EXPLORING THE FUTURE OF SECURE COMMUNICATIONS WITH QUANTUM ALGORITHMS

Arslan Nadeem, Aiman Shabbir

Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.

Journal of Engineering Education and Practice•Dec 31, 2023•0 citations
The advent of quantum computing has profound implications for digital security. Traditional cryptographic methods, which currently protect online banking, secure communications, and digital asset transfers, stand at risk of obsolescence once large-scale quantum computers become a reality. This chapter offers a conceptual and theoretical exploration of quantum-resistant cryptography within the broader context of post-quantum security. It examines key theoretical frameworks underpinning cryptographic protocols, highlights the historical and contemporary debates on transitioning to post-quantum algorithms, and synthesizes existing scholarly research to identify enduring gaps. The chapter proposes new conceptual models to guide practitioners, policymakers, and researchers as they navigate the complex shift from classical cryptography to quantum-resistant techniques. By analyzing essential constructs such as lattice-based cryptography, code-based approaches, and multivariate polynomial cryptosystems, the discussion illuminates both challenges and opportunities.
Post-quantum cryptography is essential for safeguarding digital communications against the emerging threat posed by quantum computers, which can potentially break traditional cryptographic algorithms. This paper explores the vulnerabilities of current cryptographic systems to quantum attacks and examines the development of post-quantum algorithms designed to resist such threats. We analyze various candidate cryptographic schemes, including lattice-based, code-based, and multivariate polynomial cryptography, highlighting their theoretical foundations and practical implementations. Additionally, the paper discusses the challenges of transitioning to post-quantum standards, including key management and integration with existing systems.
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.
The advent of quantum computing poses a significant challenge to conventional cryptographic methods such as RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman key exchange. Quantum algorithms, particularly Shor’s algorithm, have the potential to break these encryption techniques, making it essential to develop cryptographic approaches that can withstand quantum threats. Post-quantum cryptography (PQC) has emerged as a crucial area of research, aiming to establish cryptographic mechanisms that remain secure even in the presence of quantum adversaries. This study presents a detailed comparative analysis of five primary categories of quantum-resistant cryptographic algorithms: lattice-based, code-based, hash-based, multivariate polynomial, and isogeny-based encryption schemes. Each of these approaches offers distinct advantages and challenges in terms of security, efficiency, and implementation feasibility. Among them, lattice-based cryptography has gained significant attention due to its robust security properties and computational efficiency, making it a strong candidate for standardization. Conversely, code-based cryptography provides high security but is hindered by its large key sizes, affecting its practical deployment. The research includes a real-time performance assessment of selected PQC algorithms, analyzing key factors such as encryption speed, key size, and computational demands. Furthermore, the study examines the challenges associated with transitioning from classical encryption standards to quantum-resistant frameworks, including compatibility constraints, computational overhead, and the necessity for global standardization. Potential mitigation approaches, such as hybrid cryptographic techniques that integrate both classical and post-quantum encryption models, are also explored. Our findings emphasize that while quantum-resistant cryptography is still evolving, early adoption of PQC frameworks is essential for safeguarding future communication networks. This paper provides valuable insights for researchers, cybersecurity professionals, and policymakers on strategic measures to implement quantum-secure encryption systems effectively.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.
The rapid development of quantum computing is one of the most transformative technological developments of the twenty-first century with profound implications for cybersecurity, digital governance and the future of secure communication systems. Traditional cryptographic infrastructures have fundamentally underpinned digital trust in banking, healthcare, defense, cloud computing, and global communication networks, but the advent of quantum computational power has led to increasing concern about the future of existing standards for encryption. This qualitative study critically examines the changing relationship between quantum computing and post-quantum cryptography through an analysis of the technological, institutional, ethical and governance challenges in the transition to quantum-secure digital systems. The study adopts an interpretivist and exploratory qualitative orientation that aims to understand how governments, cybersecurity experts, technology institutions and policy frameworks are responding to the disruptive potential of quantum technologies. Data were collected using thematic analysis of academic literature, cybersecurity policy documents, archival technological reviews, expert commentaries, institutional reports, and emerging case studies related to the development of quantum-resistant cryptography. The results show that quantum computing presents serious threats to existing public-key cryptographic systems, especially in terms of theoretical abilities of Shor’s algorithm and future quantum decryption models. Meanwhile, the paper outlines post-quantum cryptography as a vital avenue for safeguarding digital privacy, institutional credibility, and cybersecurity robustness in an ever more networked society. The analysis also points to ongoing challenges around technological readiness, regulatory uncertainty, global standardization, resource inequality and ethical issues around surveillance, privacy and digital sovereignty. Yet, the research points to the potential for secure digital transformation, resilient cybersecurity governance, and the re-inventing of future communication infrastructure through post-quantum innovation. The research finds that the transition to quantum-secure systems is not just a technological challenge, but a multidimensional governance and policy challenge requiring international cooperation, ethical foresight and proactive institutional change.
Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.