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

Rethinking Security: Cryptography in the Age of Quantum Computing

John Olusegun Fajinmi

Published Apr 17, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.22541/au.174492500.06660684/v1

Related papers

Quantum Computing and Its Impact on Modern Cybersecurity and Cryptography

John Olusegun Fajinmi

The rapid advancement of quantum computing poses both transformative opportunities and profound challenges for modern cybersecurity and cryptography. Unlike classical computers, quantum systems leverage the principles of quantum mechanics-superposition, entanglement, and quantum tunneling-to process information in fundamentally new ways, enabling exponentially faster computation for certain problems. This paradigm shift threatens to render many of today's widely adopted cryptographic algorithms obsolete, particularly those relying on the hardness of integer factorization (e.g., RSA) and discrete logarithms (e.g., ECC and DSA). Quantum algorithms, such as Shor's algorithm, have the potential to break these cryptosystems in polynomial time, exposing sensitive data to unprecedented levels of vulnerability. Additionally, Grover's algorithm accelerates brute-force attacks on symmetric encryption schemes, reducing their effective security strength by half. This paper explores the implications of quantum computing on current cryptographic infrastructures, highlighting the urgency for transitioning to quantum-resistant or postquantum cryptographic algorithms. It examines emerging standards from bodies such as NIST, which are fostering the development and evaluation of lattice-based, codebased, multivariate polynomial, and hash-based cryptographic solutions. Furthermore, the study delves into the dual-edged nature of quantum computing in cybersecuritydiscussing its potential not only as a threat but also as a powerful tool for enhancing security through quantum key distribution (QKD), quantum random number generation, and other quantum-enhanced protocols. The work concludes by evaluating the readiness of current systems for the "quantum threat," identifying gaps in awareness, infrastructure, and policy, and proposing a strategic roadmap for a secure transition into the post-quantum era. As the quantum revolution accelerates, understanding and preparing for its cybersecurity ramifications is not merely a technical necessity but a cornerstone of global digital resilience.

•Apr 16, 2025•1 citation

Quantum Computing Threats to Traditional Encryption Algorithms

Sai Kalyani Rachapalli -

Quantum computing is poised to revolutionize numerous fields, including cryptography. Traditional encryption algorithms that form the backbone of modern digital security, such as RSA and Elliptic Curve Cryptography (ECC), rely on computationally difficult problems—specifically, the factorization of large integers and the solving of discrete logarithms. However, quantum computers, leveraging the principles of quantum mechanics, present the potential to solve these problems in polynomial time through algorithms like Shor’s Algorithm, rendering these encryption methods insecure. The development of sufficiently powerful quantum computers could therefore undermine the confidentiality and integrity of sensitive digital information across the internet. This paper explores the threats posed by quantum computing to traditional cryptographic systems, with a focus on the impact of Shor’s Algorithm and Grover’s Algorithm. In addition, the paper reviews ongoing efforts to develop quantum-resistant cryptographic techniques, particularly in the area of post-quantum cryptography (PQC). It discusses the NIST Post-Quantum Cryptography Standardization project, the promising alternatives to current encryption schemes, and the potential for quantum key distribution (QKD) as a solution. The paper concludes with a reflection on the urgent need to prepare for quantum computing's eventual impact on digital security and the steps that can be taken to mitigate these risks in the transition to quantum-safe cryptography.

International Journal For Multidisciplinary Research•Mar 6, 2021•0 citations

Post-Quantum Cryptography: Evaluating and Standardizing Quantum-Resistant Algorithms

Godwin Olaoye

The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.

•Apr 9, 2025•2 citations

The Implications of Quantum Computing on Conventional Encryption Techniques: Investigation of Cybersecurity Risks and Security Measures

Karthikeyan Gurunathan, Sandhya Murali Parthasarathy, Sathiyandrakumar Srinivasan

Quantum computing is a transformational technology once implemented, capable of addressing problems far beyond the capacity of classical computers. But this progress is also a real challenge to the core of today's modern security. Traditional cryptographic algorithms, such as those based on RSA, ECC, and Diffie-Hellman key exchange, are based on the computational hardness of problems such as prime factorization and discrete logarithms that quantum algorithms solve in polynomial time. As a particular research interesting example, with Shor's Algorithm one can factorize large numbers efficiently, rendering insecure the majority of public key cryptosystems used nowadays. This urgently demands a reevaluation of existing encryption schemes in the context of a post-quantum world. In this paper, we take a closer look at the threats that quantum computers pose to classical security infrastructure including encryption scheme and explore the impact that quantum computation can have on current cryptographic schemes. It calculates the cost in terms of symmetric and asymmetric security, accounting for effects of both Shor's and Grover's algorithms. Symmetric key systems such as AES are also harder hit—Grover's algorithm can give only a quadratic speedup here—but they do need to double key sizes for a sufficient level of post-quantum security. In reaction to those threats, the paper investigates nextgeneration post-quantum cryptographic (PQC) solutions resistant to quantum cryptanalysis. Lattice-based cryptosystems, hash-based signature schemes, multivariate polynomial systems, and code-based cryptosystems are some of the candidates that are being considered in international standardization work, including especially at NIST. In this paper, we compare those alternatives for security, performance, scalability, and feasibility of implementation in real system. An important aspect of this contribution is a comparative study of traditional and post-quantum cryptographic protocols in the context of a number of cybersecurity applications, including secure communications, blockchain networks and IoT contexts. It also covers the quantum readiness timeline and transitional issues, such as backward compatibility, standardization lag and the associated increased computational overhead. Through a mitigated risk evaluation and cryptanalytic attack simulation based on quantum-inspired algorithms, this analysis emphasizes the need to prepare ourselves against quantum-induced security issues. It provides strategic guidance to organizations as they plan for the post-quantum future, stressing cryptographic agility, hybrid encryption models and real-time threat monitoring. Ultimately, the results of this work add to the worldwide conversation on establishing secure systems within the digital age of quantum computing and recommend proactive migration plans for the integrity, confidentiality, and trust one should have in the future cyber world.

IEEE International Conference on ICT in Business Industry & Government (ICTBIG)•Dec 12, 2025•0 citations

Quantum Computing in the Spotlight: Redefining Cybersecurity and Cryptography

John Olusegun Fajinmi

Quantum computing, a transformative leap in computational science, is rapidly emerging as a disruptive force capable of reshaping the foundational pillars of cybersecurity and cryptography. Unlike classical computing, which relies on binary states, quantum computing utilizes quantum bits (qubits), leveraging the principles of superposition, entanglement, and quantum tunneling to perform complex calculations at unprecedented speeds. This paradigm shift poses a dual-edged impact on the field of cybersecurity: it offers unparalleled potential for advancing secure communication through quantum cryptographic protocols such as Quantum Key Distribution (QKD), while simultaneously threatening the integrity of classical encryption methods like RSA and ECC, which could be rendered obsolete by quantum algorithms like Shor's and Grover's. This paper explores the current state of quantum computing, its implications for existing cryptographic infrastructures, and the urgent need for post-quantum cryptography (PQC) standards. It also examines governmental and institutional responses to the quantum threat, including NIST's ongoing PQC standardization efforts, and the development of hybrid cryptographic models that combine quantumresistant algorithms with classical security measures. Furthermore, the study discusses ethical considerations, regulatory challenges, and the importance of global cooperation in transitioning to a quantum-secure digital future. As quantum technology progresses from theoretical frameworks to practical applications, cybersecurity must evolve in tandem to address both its promises and perils.

•Apr 16, 2025•3 citations

Quantum Computing and Cryptography: Security Challenges and Post-Quantum Solutions

Alok Priyadarshi, Raushan Kumar, Kumar Soumya +2 more

Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.

International Conference on Secure Information Systems and Technologies (ICSIST)•Aug 1, 2026•0 citations
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 rapid advancement of quantum computing poses both transformative opportunities and profound challenges for modern cybersecurity and cryptography. Unlike classical computers, quantum systems leverage the principles of quantum mechanics-superposition, entanglement, and quantum tunneling-to process information in fundamentally new ways, enabling exponentially faster computation for certain problems. This paradigm shift threatens to render many of today's widely adopted cryptographic algorithms obsolete, particularly those relying on the hardness of integer factorization (e.g., RSA) and discrete logarithms (e.g., ECC and DSA). Quantum algorithms, such as Shor's algorithm, have the potential to break these cryptosystems in polynomial time, exposing sensitive data to unprecedented levels of vulnerability. Additionally, Grover's algorithm accelerates brute-force attacks on symmetric encryption schemes, reducing their effective security strength by half. This paper explores the implications of quantum computing on current cryptographic infrastructures, highlighting the urgency for transitioning to quantum-resistant or postquantum cryptographic algorithms. It examines emerging standards from bodies such as NIST, which are fostering the development and evaluation of lattice-based, codebased, multivariate polynomial, and hash-based cryptographic solutions. Furthermore, the study delves into the dual-edged nature of quantum computing in cybersecuritydiscussing its potential not only as a threat but also as a powerful tool for enhancing security through quantum key distribution (QKD), quantum random number generation, and other quantum-enhanced protocols. The work concludes by evaluating the readiness of current systems for the "quantum threat," identifying gaps in awareness, infrastructure, and policy, and proposing a strategic roadmap for a secure transition into the post-quantum era. As the quantum revolution accelerates, understanding and preparing for its cybersecurity ramifications is not merely a technical necessity but a cornerstone of global digital resilience.
Quantum computing is poised to revolutionize numerous fields, including cryptography. Traditional encryption algorithms that form the backbone of modern digital security, such as RSA and Elliptic Curve Cryptography (ECC), rely on computationally difficult problems—specifically, the factorization of large integers and the solving of discrete logarithms. However, quantum computers, leveraging the principles of quantum mechanics, present the potential to solve these problems in polynomial time through algorithms like Shor’s Algorithm, rendering these encryption methods insecure. The development of sufficiently powerful quantum computers could therefore undermine the confidentiality and integrity of sensitive digital information across the internet. This paper explores the threats posed by quantum computing to traditional cryptographic systems, with a focus on the impact of Shor’s Algorithm and Grover’s Algorithm. In addition, the paper reviews ongoing efforts to develop quantum-resistant cryptographic techniques, particularly in the area of post-quantum cryptography (PQC). It discusses the NIST Post-Quantum Cryptography Standardization project, the promising alternatives to current encryption schemes, and the potential for quantum key distribution (QKD) as a solution. The paper concludes with a reflection on the urgent need to prepare for quantum computing's eventual impact on digital security and the steps that can be taken to mitigate these risks in the transition to quantum-safe cryptography.
The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.
Quantum computing is a transformational technology once implemented, capable of addressing problems far beyond the capacity of classical computers. But this progress is also a real challenge to the core of today's modern security. Traditional cryptographic algorithms, such as those based on RSA, ECC, and Diffie-Hellman key exchange, are based on the computational hardness of problems such as prime factorization and discrete logarithms that quantum algorithms solve in polynomial time. As a particular research interesting example, with Shor's Algorithm one can factorize large numbers efficiently, rendering insecure the majority of public key cryptosystems used nowadays. This urgently demands a reevaluation of existing encryption schemes in the context of a post-quantum world. In this paper, we take a closer look at the threats that quantum computers pose to classical security infrastructure including encryption scheme and explore the impact that quantum computation can have on current cryptographic schemes. It calculates the cost in terms of symmetric and asymmetric security, accounting for effects of both Shor's and Grover's algorithms. Symmetric key systems such as AES are also harder hit—Grover's algorithm can give only a quadratic speedup here—but they do need to double key sizes for a sufficient level of post-quantum security. In reaction to those threats, the paper investigates nextgeneration post-quantum cryptographic (PQC) solutions resistant to quantum cryptanalysis. Lattice-based cryptosystems, hash-based signature schemes, multivariate polynomial systems, and code-based cryptosystems are some of the candidates that are being considered in international standardization work, including especially at NIST. In this paper, we compare those alternatives for security, performance, scalability, and feasibility of implementation in real system. An important aspect of this contribution is a comparative study of traditional and post-quantum cryptographic protocols in the context of a number of cybersecurity applications, including secure communications, blockchain networks and IoT contexts. It also covers the quantum readiness timeline and transitional issues, such as backward compatibility, standardization lag and the associated increased computational overhead. Through a mitigated risk evaluation and cryptanalytic attack simulation based on quantum-inspired algorithms, this analysis emphasizes the need to prepare ourselves against quantum-induced security issues. It provides strategic guidance to organizations as they plan for the post-quantum future, stressing cryptographic agility, hybrid encryption models and real-time threat monitoring. Ultimately, the results of this work add to the worldwide conversation on establishing secure systems within the digital age of quantum computing and recommend proactive migration plans for the integrity, confidentiality, and trust one should have in the future cyber world.
Quantum computing, a transformative leap in computational science, is rapidly emerging as a disruptive force capable of reshaping the foundational pillars of cybersecurity and cryptography. Unlike classical computing, which relies on binary states, quantum computing utilizes quantum bits (qubits), leveraging the principles of superposition, entanglement, and quantum tunneling to perform complex calculations at unprecedented speeds. This paradigm shift poses a dual-edged impact on the field of cybersecurity: it offers unparalleled potential for advancing secure communication through quantum cryptographic protocols such as Quantum Key Distribution (QKD), while simultaneously threatening the integrity of classical encryption methods like RSA and ECC, which could be rendered obsolete by quantum algorithms like Shor's and Grover's. This paper explores the current state of quantum computing, its implications for existing cryptographic infrastructures, and the urgent need for post-quantum cryptography (PQC) standards. It also examines governmental and institutional responses to the quantum threat, including NIST's ongoing PQC standardization efforts, and the development of hybrid cryptographic models that combine quantumresistant algorithms with classical security measures. Furthermore, the study discusses ethical considerations, regulatory challenges, and the importance of global cooperation in transitioning to a quantum-secure digital future. As quantum technology progresses from theoretical frameworks to practical applications, cybersecurity must evolve in tandem to address both its promises and perils.
Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.