loading page

Implementation and Analysis of Shor's Algorithm to Break RSA Cryptosystem Security
  • Siyon Singh,
  • Eric Sakk
Siyon Singh
Foundation Academy, IIT Patna

Corresponding Author:[email protected]

Author Profile
Eric Sakk
Morgan State University

Abstract

The ongoing development of Quantum Computing (QC) is a breakthrough paradigm that holds the power to revolutionize the way we process information and solve complex problems today. Quantum Computation works on the fundamental principles of Superposition and Entanglement, enabling Quantum Computers to Leverage the power of Physics in Computing. QC has the potential to revolutionize fields such as Drug Development, Financial Modeling, Optimization, and Cryptography. Shor’s algorithm, a quantum algorithm used to factorize large numbers, poses significant threats to RSA, a widely used public key cryptosystem. RSA relies on the difficulty of factoring large semi-primes to keep its security. Shor's algorithm's ability to factorize quickly on a quantum computer undermines RSA's security assumptions, necessitating the exploration of post-quantum cryptographic solutions to ensure secure communication in the quantum era. The goal of this paper is to assess the present state of Shor's algorithm implementation and efficiency, specifically its application in the context of compromising public key cryptosystems like RSA.
23 Dec 2023Submitted to TechRxiv
08 Jan 2024Published in TechRxiv