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

Progress in IS

Key Insights on the Use of Quantum Computing in Breaking Cryptographic Algorithms

Khemant Nirvaan Degambur, Girish Bekaroo

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-14099-9_12

Related papers

Quantum Computing for Cryptanalysis: Breaking Modern Cryptographic Protocols

Jessica Roberts, Jennifer Leigh Clarke

Quantum computing poses a fundamental threat to modern cryptographic protocols by exploiting quantum algorithms that surpass classical computational limits. Shor’s algorithm can efficiently factor large integers, breaking RSA and other public-key cryptosystems, while Grover’s algorithm accelerates brute-force attacks against symmetric encryption. As quantum hardware advances, traditional cryptographic schemes risk obsolescence, necessitating the development of quantum-resistant cryptographic techniques. This paper explores the theoretical foundations of quantum cryptanalysis, examining key algorithms, their implications for cybersecurity, and the current state of post-quantum cryptographic solutions. By analyzing resource estimates for quantum attacks and potential mitigation strategies, this study provides a comprehensive overview of the evolving cryptographic landscape in the quantum era.

International Journal on Advanced Electrical and Computer Engineering•Apr 15, 2025•0 citations

Exploring the Security Implications of Quantum Computing on Current Encryption Techniques

Sandeep Dommari

•Jan 1, 2025•0 citations

Quantum Computing For Cryptographic Security With Artificial Intelligence

Rahul Vadisetty, Anand Polamarasetti

Quantum computing is one of the shifts in paradigm with the potential to break most cryptographic systems. Quantum computers will run complex problems with superposition and entanglement much faster exponentially than classical computers. This poses a solid threat to cryptographic security by efficiently factoring large integers using quantum algorithms like Shor's algorithm, possibly breaking public-key cryptosystems like RSA and ECC. Moreover, Grover's algorithm speeds up symmetric key algorithms brute-force search. This paper discusses these vulnerabilities, surveys the development and feasibility of quantum-resistant algorithms, and addresses practical challenges from their implementations. Finally, it points out standardization processes underway and computation paths for further research. Our findings underline the need to urgently migrate to quantum-resistant cryptographic solutions for robust security in the presence of quantum computing.

International Conference on Control, Mechatronics and Automation (ICCMA)•Nov 11, 2024•19 citations

The Impact of Quantum Computing on Present Cryptography

Shivam Gangwar, Vivek Pachnanda, Tushar Pundir

•Jan 1, 2025•3 citations

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

Alok Priyadarshi, Raushan Kumar, Kumar Soumya +2 more

International Conference on Secure Information Systems and Technologies (ICSIST)•Aug 1, 2026•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
Quantum computing poses a fundamental threat to modern cryptographic protocols by exploiting quantum algorithms that surpass classical computational limits. Shor’s algorithm can efficiently factor large integers, breaking RSA and other public-key cryptosystems, while Grover’s algorithm accelerates brute-force attacks against symmetric encryption. As quantum hardware advances, traditional cryptographic schemes risk obsolescence, necessitating the development of quantum-resistant cryptographic techniques. This paper explores the theoretical foundations of quantum cryptanalysis, examining key algorithms, their implications for cybersecurity, and the current state of post-quantum cryptographic solutions. By analyzing resource estimates for quantum attacks and potential mitigation strategies, this study provides a comprehensive overview of the evolving cryptographic landscape in the quantum era.
Quantum computing is one of the shifts in paradigm with the potential to break most cryptographic systems. Quantum computers will run complex problems with superposition and entanglement much faster exponentially than classical computers. This poses a solid threat to cryptographic security by efficiently factoring large integers using quantum algorithms like Shor's algorithm, possibly breaking public-key cryptosystems like RSA and ECC. Moreover, Grover's algorithm speeds up symmetric key algorithms brute-force search. This paper discusses these vulnerabilities, surveys the development and feasibility of quantum-resistant algorithms, and addresses practical challenges from their implementations. Finally, it points out standardization processes underway and computation paths for further research. Our findings underline the need to urgently migrate to quantum-resistant cryptographic solutions for robust security in the presence of quantum computing.
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.