Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Automation, Computing and Renewable Systems (ICACRS)

PQC Secure: Strategies for Defending Against Quantum Threats

A Jenefa, Francisxavier Thomas Josh, Antony Taurshia, K Rathina Kumar, S Kowsega, Edward Naveen. V

Published Dec 11, 2023• 21 citations
Publisher

Abstract

As quantum computing emerges, the security domain is set to encounter unparalleled challenges, necessitating a pivotal shift to Post-Quantum Cryptography (PQC) for safeguarding against quantum adversities. Current cryptographic mechanisms, especially RSA and ECC, are susceptible to quantum breaches due to their reliance on factorization and discrete logarithm problems. The emergence of quantum computers endangers traditional cryptographic infrastructures, exposing them to swift decryption by algorithms like Shor’s, $N=p \cdot q$, and Grover’s, $r \equiv a^{\frac{N}{2}} \bmod N$, where N is the product of two significant primes, p and q, and r denotes the remainder after applying Grover’s algorithm to a. Conventional cryptographic methods, which rest on problems solvable by quantum computers, emphasize the need to transition to PQC, substituting prevalent methods with quantum-resilient alternatives, represented by $E=m^{e} \bmod n$, where E is the encrypted message, m the plaintext, e the public key exponent, and n the product of two prime numbers. This research evaluates the efficacy of PQC approaches, encompassing lattice-based, code-based, and isogeny-based cryptography, with assessments based on metrics like encryption duration, $T_{e}=\frac{1}{f_{e}}$, and key length, $\log _{2}(N)$, where $T_{e}$ represents encryption time and $f_{e}$ the encryption speed. Employing standardized datasets, we examine encryption and decryption speeds, key sizes, and success metrics against NIST’s endorsed security standards. The findings underscore PQC’s potential in delivering robust security, albeit with variations in performance metrics, guiding secure communication choices. In summation, the study highlights the essential shift to PQC in addressing the vulnerabilities ushered in by quantum computing, presenting a spectrum of fortified strategies for the future of information security.

DOI
10.1109/icacrs58579.2023.10404525

Related papers

Quantum computing in cryptography: Exploring vulnerabilities and countermeasures

Deni Kurniawan, Dedi Triyanto, Mochamad Wahyudi +1 more

This research delves into the critical analysis of vulnerabilities arising from the advent of quantum computing in traditional cryptographic systems. Employing a newly developed mathematical formulation model, the study meticulously evaluates the susceptibility of classical encryption methods, exemplified by XYZ Bank's RSA and ECC algorithms, to quantum algorithms such as Shor's and Grover's. The assessment reveals pronounced vulnerabilities, particularly highlighting the high susceptibility of RSA encryption to quantum attacks, emphasizing the urgent need to fortify existing cryptographic systems. The research rigorously evaluates potential countermeasures, with Post-Quantum Cryptography (PQC) emerging as a promising solution, showcasing superior effectiveness in mitigating vulnerabilities posed by quantum algorithms. The strategic imperative for organizations to transition towards PQC or other post-quantum cryptographic standards is evident, signaling a paradigm shift towards resilient encryption methods resilient to the disruptive capabilities of quantum computing. The research underscores the significance of collaboration among industry stakeholders, continuous research endeavors, and proactive measures in adopting quantum-resistant cryptographic standards to fortify data security strategies against potential quantum threats in an ever-evolving technological landscape.

Jurnal Teknik Informatika C I T Medicom•Sep 30, 2023•0 citations

A High-Level Security Techniques on Quantum Security for Post Quantum Cryptography

Williams Deepan R H, A. Ajina

With the rapid advancement regarding quantum computing, traditional cryptographic systems face an existential threat because of their reliance concerning mathematical challenges which may be addressed effectively solved using quantum algorithms like the one developed by Shor. This imminent risk has driven extensive research into quantum-resistant cryptography (PQC), that seeks to develop encryption methods resilient against attacks powered by quantum computing. This study offers a thorough literature survey on high-level security techniques in quantum security for PQC, analysing past and current research efforts in this domain. We first examine the vulnerabilities of classical cryptographic protocols, including public-key encryption methods such as RSA (developed by Rivest, Shamir, and Adleman) and ECC (which uses elliptic curve mathematics), and traditional cryptographic hashing methods, against quantum adversaries. The study then explores the foundational approaches to quantum-secure cryptography, including lattice-based, hash-based, multivariate polynomial, code-based, and isogeny-based encryption methods that possess emerged as promising candidates for standardization. The survey highlights key challenges in the real-world application of PQC, including performance trade-offs, key size overhead, and deployment complexities. We conclude by identifying future research directions during the creation of scalable, efficient, and provably secure cryptographic methods designed to withstand quantum attacks techniques. As the shift toward the quantum-resilient era approaches, this survey aims to provide a clear and structured comprehension of the evolving the domain of quantum security for PQC.

International Conference on Emerging Technologies in Computing and Communication (ETCC)•Jun 26, 2025•1 citation

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

Suvhodip Saha

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

International Journal for Research in Applied Science and Engineering Technology•Mar 24, 2026•0 citations

Survey on Quantum-Safe Cryptography for PostQuantum Internet Security

MURALI KRISHNA DARA

The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.

International Journal of Engineering Research and Science & Technology•Feb 6, 2024•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•0 citations

Securing the Future: Shifting to Post-Quantum Cryptography Amidst Quantum Threats

Yidan Sun

Current cryptographic systems, heavily reliant on classical algorithms, are increasingly vulnerable to the formidable capabilities of quantum computing. Notably, quantum algorithms such as Shor’s and Grover’s pose profound threats by accelerating decryption processes, which could soon make existing cryptosystems ineffective. This paper stresses the critical need and complexity of shifting to Post-Quantum Cryptography (PQC) to safeguard encrypted communications against these emerging quantum threats. It outlines the timeline of the National Institute of Standards and Technology’s (NIST) efforts in standardizing PQC, elucidating the significant challenges and the essential nature of adopting these new standards. While NIST provides structured guidance, transitioning to PQC presents substantial risks and difficulties, particularly in terms of organizational adaptation and the technical overhaul required. The discourse further explores the tangible implications of quantum advancements on both symmetric and asymmetric key cryptography, highlighting the potential vulnerabilities and the increased risk of security breaches. The paper underscores the imperative for immediate action in initiating the transition towards robust PQC systems, given the rapid development and anticipated deployment of quantum computing technologies capable of decrypting currently secure information. This transition is not merely a technical upgrade but a crucial strategic move to preemptively counteract quantum threats, ensuring the continued confidentiality and integrity of sensitive data across various sectors.

Applied and Computational Engineering•Nov 28, 2024•2 citations
As quantum computing emerges, the security domain is set to encounter unparalleled challenges, necessitating a pivotal shift to Post-Quantum Cryptography (PQC) for safeguarding against quantum adversities. Current cryptographic mechanisms, especially RSA and ECC, are susceptible to quantum breaches due to their reliance on factorization and discrete logarithm problems. The emergence of quantum computers endangers traditional cryptographic infrastructures, exposing them to swift decryption by algorithms like Shor’s, N=p⋅qN=p \cdot qN=p⋅q, and Grover’s, r≡aN2 mod Nr \equiv a^{\frac{N}{2}} \bmod Nr≡a2N​modN, where N is the product of two significant primes, p and q, and r denotes the remainder after applying Grover’s algorithm to a. Conventional cryptographic methods, which rest on problems solvable by quantum computers, emphasize the need to transition to PQC, substituting prevalent methods with quantum-resilient alternatives, represented by E=me mod nE=m^{e} \bmod nE=memodn, where E is the encrypted message, m the plaintext, e the public key exponent, and n the product of two prime numbers. This research evaluates the efficacy of PQC approaches, encompassing lattice-based, code-based, and isogeny-based cryptography, with assessments based on metrics like encryption duration, Te=1feT_{e}=\frac{1}{f_{e}}Te​=fe​1​, and key length, log⁡2(N)\log _{2}(N)log2​(N), where TeT_{e}Te​ represents encryption time and fef_{e}fe​ the encryption speed. Employing standardized datasets, we examine encryption and decryption speeds, key sizes, and success metrics against NIST’s endorsed security standards. The findings underscore PQC’s potential in delivering robust security, albeit with variations in performance metrics, guiding secure communication choices. In summation, the study highlights the essential shift to PQC in addressing the vulnerabilities ushered in by quantum computing, presenting a spectrum of fortified strategies for the future of information security.
This research delves into the critical analysis of vulnerabilities arising from the advent of quantum computing in traditional cryptographic systems. Employing a newly developed mathematical formulation model, the study meticulously evaluates the susceptibility of classical encryption methods, exemplified by XYZ Bank's RSA and ECC algorithms, to quantum algorithms such as Shor's and Grover's. The assessment reveals pronounced vulnerabilities, particularly highlighting the high susceptibility of RSA encryption to quantum attacks, emphasizing the urgent need to fortify existing cryptographic systems. The research rigorously evaluates potential countermeasures, with Post-Quantum Cryptography (PQC) emerging as a promising solution, showcasing superior effectiveness in mitigating vulnerabilities posed by quantum algorithms. The strategic imperative for organizations to transition towards PQC or other post-quantum cryptographic standards is evident, signaling a paradigm shift towards resilient encryption methods resilient to the disruptive capabilities of quantum computing. The research underscores the significance of collaboration among industry stakeholders, continuous research endeavors, and proactive measures in adopting quantum-resistant cryptographic standards to fortify data security strategies against potential quantum threats in an ever-evolving technological landscape.
With the rapid advancement regarding quantum computing, traditional cryptographic systems face an existential threat because of their reliance concerning mathematical challenges which may be addressed effectively solved using quantum algorithms like the one developed by Shor. This imminent risk has driven extensive research into quantum-resistant cryptography (PQC), that seeks to develop encryption methods resilient against attacks powered by quantum computing. This study offers a thorough literature survey on high-level security techniques in quantum security for PQC, analysing past and current research efforts in this domain. We first examine the vulnerabilities of classical cryptographic protocols, including public-key encryption methods such as RSA (developed by Rivest, Shamir, and Adleman) and ECC (which uses elliptic curve mathematics), and traditional cryptographic hashing methods, against quantum adversaries. The study then explores the foundational approaches to quantum-secure cryptography, including lattice-based, hash-based, multivariate polynomial, code-based, and isogeny-based encryption methods that possess emerged as promising candidates for standardization. The survey highlights key challenges in the real-world application of PQC, including performance trade-offs, key size overhead, and deployment complexities. We conclude by identifying future research directions during the creation of scalable, efficient, and provably secure cryptographic methods designed to withstand quantum attacks techniques. As the shift toward the quantum-resilient era approaches, this survey aims to provide a clear and structured comprehension of the evolving the domain of quantum security for PQC.
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.
The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.
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.
Current cryptographic systems, heavily reliant on classical algorithms, are increasingly vulnerable to the formidable capabilities of quantum computing. Notably, quantum algorithms such as Shor’s and Grover’s pose profound threats by accelerating decryption processes, which could soon make existing cryptosystems ineffective. This paper stresses the critical need and complexity of shifting to Post-Quantum Cryptography (PQC) to safeguard encrypted communications against these emerging quantum threats. It outlines the timeline of the National Institute of Standards and Technology’s (NIST) efforts in standardizing PQC, elucidating the significant challenges and the essential nature of adopting these new standards. While NIST provides structured guidance, transitioning to PQC presents substantial risks and difficulties, particularly in terms of organizational adaptation and the technical overhaul required. The discourse further explores the tangible implications of quantum advancements on both symmetric and asymmetric key cryptography, highlighting the potential vulnerabilities and the increased risk of security breaches. The paper underscores the imperative for immediate action in initiating the transition towards robust PQC systems, given the rapid development and anticipated deployment of quantum computing technologies capable of decrypting currently secure information. This transition is not merely a technical upgrade but a crucial strategic move to preemptively counteract quantum threats, ensuring the continued confidentiality and integrity of sensitive data across various sectors.