Quantum Decryption using Shor’s Algorithm

This paper presents the generalized implementation of the quantum circuit utilized in Shor’s algorithm, which was simulated using the quantum simulator offered by IBM. Shor’s Algorithm is a ground-breaking Quantum Algorithm that works on Integer Factorization; for a classical computer, the following task would require an exponential amount of time, whereas a Quantum Computer running Shor’s Algorithm would only require Polynomial-time. Using the principles of Quantum Superposition and Quantum Entanglement, the algorithm demonstrates the potential of quantum computing to solve complex mathematical problems efficiently. Experimental results show the effectiveness of the implemented algorithm in Integer Factorization and discrete logarithm, disturbing the safety of major encryption algorithms. This paper contributes to advancing the understanding and practical application of quantum algorithms in real-world scenarios.