Enhanced Shor’s algorithm with quantum circuit optimization

Most researchers in the field of cryptography are very aware of attack possibilities from quantum computers. Large integer factorization remains a difficult challenge, How- ever, using Shor’s method, the brute force attack potential of assailants on various asymmetric key cryptosystems, such as RSA and ECDSA, are significantly enhanced. The effec- tiveness of Shor’s Algorithm allows us to factor big numbers in polynomial time.This research paper presents an enhanced version of Shor’s algorithm for factoring large numbers using quantum computing. The algorithm incorporates quantum circuit optimization techniques to reduce the resource requirements, making it more efficient and practical. The essence of our work lies in not only breaking down the seemingly insurmountable barriers posed by large integers but also doing so with resource efficiency in mind. By harnessing the principles of quantum circuit optimization, we have achieved a remarkable reduction in the computational resources required. This optimization doesn’t just make our algorithm theoretically superior; it transforms it into a practical tool for cryptographic analysis. We analyze the quantum circuit optimization steps and demonstrate the efficiency of the enhanced algorithm through simulations and comparisons with the standard version of Shor’s algorithm.