Unveiling the Threat: Quantum Factorization Techniques and Their Impact on RSA Cryptosystems
Hanan Khaled, Maha A. Metawei, Sherif M. Saif, Mohamed Taher, Salwa M. Nassar · 2025
The Rivest-Shamir-Adleman (RSA) cryptosystem plays a critical role in modern cybersecurity, relying on the complexity of factoring large biprime numbers, a task that is computationally hard for classical computers. However, the ongoing advancements in quantum computing pose significant risks to the RSA system, as quantum algorithms can solve the biprime factorization problem in a polynomial time. Among the most concerning quantum algorithms for RSA security are Shor's algorithm and the Variational Quantum Factoring (VQF) algorithm. This paper delves into the potential threats posed by these algorithms, offering a thorough examination of their implications. Additionally, it presents a comprehensive review of experimental efforts aimed at RSA factorization using quantum computing platforms. Moreover, The paper discusses the implications of ongoing advancements in quantum hardware on RSA cryptosystem. Therefore, we demonstrate strategic recommendations to help organizations transition to cryptographic systems resilient to quantum computing threats, ultimately enhancing their cybersecurity posture and safeguarding sensitive data from future quantum-enabled vulnerabilities.