Abstract Shor’s algorithm represents a landmark advancement in quantum computing, offering an efficient method for integer factorization, a problem that is computationally hard for classical computers. A core component of the algorithm is the Quantum Fourier Transform (QFT), which enables fast Fourier analysis on quantum hardware. This study focuses on the implementation and analysis of Shor’s algorithm on a 5-qubit IBM quantum computer, exploring both the theoretical principles and practical execution on a limited quantum device. By examining this implementation, we highlight the potential impact of quantum computing on classical cryptographic schemes, assess risks to information security, and discuss the algorithm’s efficiency, scalability, and applicability in real-world computational environments.
Abstract Shor’s algorithm represents a landmark advancement in quantum computing, offering an efficient method for integer factorization, a problem that is computationally hard for classical computers. A core component of the algorithm is the Quantum Fourier Transform (QFT), which enables fast Fourier analysis on quantum hardware. This study focuses on the implementation and analysis of Shor’s algorithm on a 5-qubit IBM quantum computer, exploring both the theoretical principles and practical execution on a limited quantum device. By examining this implementation, we highlight the potential impact of quantum computing on classical cryptographic schemes, assess risks to information security, and discuss the algorithm’s efficiency, scalability, and applicability in real-world computational environments.
Quantum computing has emerged as a groundbreaking technology, revolutionizing the speed and capabilities of computation. Traditional computing, based on bits represented by 0s and 1s, has limitations in storage and computational efficiency, even with parallel processing. In contrast, quantum computing operates on qubits, enabling exponential reductions in storage requirements and faster computation via quantum parallelism. One prominent quantum algorithm, Shor's Algorithm, presents a significant threat to RSA encryption. This Algorithm efficiently factors large integers, a task considered intractable for classical computers. By leveraging classical and quantum computation techniques, Shor's Algorithm employs the Euclidean algorithm and the Quantum Fourier Transform (QFT) to find the greatest common divisor and perform period-finding, respectively. This research paper explores the implementation and implications of Shor's Algorithm in breaking RSA encryption. Through experiments conducted in IBM's Quantum Lab, the Algorithm successfully factorizes integers, showcasing its efficacy in practice. By examining the potential impact of quantum computing on RSA and exploring the capabilities of Shor's Algorithm, this research contributes to advancing the field of quantum computing and understanding its implications for modern cryptographic systems. The findings underscore the need for post-quantum cryptography to ensure secure communication and data protection in the era of quantum computing.
This dissertation analyzes the impact of quantum computing on the security of classical cryptographic systems, with a focus on the vulnerability of the RSA algorithm. RSA cryptography is based on the difficulty of factoring large prime numbers, a task considered computationally very difficulty for classical computers. However, with quantum computing, especially through Shor’s algorithm—this barrier can be overcome. Shor’s algorithm allows factorization in polynomial time, which would completely compromise the security of RSA.The dissertation presents the theoretical foundations of both cryptography and quantum computing, explaining key concepts such as qubits, superposition, entanglement, and quantum parallelism. It details the operation of Shor’s algorithm, from identifying the period of the modular exponential function to applying the Quantum Fourier Transform (QFT) and phase estimation to obtain the prime factors of a composite number.In addition to the theoretical component, the work includes practical implementations of the algorithm in both classical and simulated quantum environments, using IBM’s Qiskit library. Finally, it discusses post-quantum cryptography as a secure alternative in light of technological advancements, highlighting methods based on lattices, codes, hash functions, and multivariate systems.The conclusion emphasizes the urgency of adopting cryptographic systems resistant to quantum computing, as ongoing advances increasingly make the breaking of RSA a realistic threat. Post-quantum cryptography is mentioned as a necessary response to the challenge posed by quantum computing.In conclusion, although current quantum computers do not yet have sufficient power to break RSA in practice, technological progress is steadily bringing that scenario closer. Therefore, it is essential to develop and adopt quantum-resistant cryptographic systems to ensure information security in the coming decades.
Factoring large numbers poses a significant chal-lenge in contemporary cryptography and security practices. Shor's algorithm presents a remarkable advancement over clas- sical methods by providing exponential acceleration in factoring large numbers, presenting a possible risk to traditional cryptography methods. The algorithm relies on the Quantum Fourier Transform (QFT) and modular exponentiation principles to efficiently ascertain the period (x) of a given large number (N). Upon determining the period using classical methods, the prime factors of the large number can be easily computed. To eval- uate the algorithm's efficiency and scalability, both simulation- based experiments and theoretical analyses are conducted. The algorithm is simulated utilizing the Qiskit back end to estimate resources, including Clifford gates, T gates, T depth, Full depth, and qubits, across a range of large numbers.
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.
With the rise of large-scale quantum computers, it becomes difficult to sustain the security principles of popular public-key encryption systems, including RSA, which is based on the classical problem of integer factorization. Shor’s algorithm suggests that a large enough quantum computer may find factors of an n-bit integer in polynomial time, thus becoming a threat to RSA and similar encryption techniques once the technology of fault-tolerant hardware reaches maturity. However, current implementation is subject to several limitations regarding the number of qubits available, circuit depth, and the vulnerability to decoherence in NISQ computing. The proposed algorithm in this work provides an improved version of Shor’s algorithm that implements classical pre-processing heuristics, adaptive choice of bases, a low-depth circuit for modular exponentiation, and a compressed approximate quantum Fourier transform (AQFT) step to minimize qubit usage and depth while preserving the accuracy of period finding. The simulation results performed for different modulus sizes from 8 to 256 bits show that the suggested approach allows for reducing the number of logical qubits by about 29% and increases the success rate of the algorithm from 41% to 63%. The security considerations of such optimizations concerning the timelines of migrating from existing cryptographic systems to post-quantum systems will be addressed, as well as the possible approaches to hybrid classical and quantum factorization pipelines.
In this world of massive communication networks, data security and confidentiality are of crucial importance for maintaining secured private communication and protecting information against eavesdropping attacks. Existing cryptosystems provide data security and confidentiality by the use of encryption and signature algorithms for secured communication. Classical computers use cryptographic algorithms that use the product of two large prime numbers for generating public and private keys. These classical algorithms are based on the fact that integer factorization is a non-deterministic polynomial-time (NP) problem and requires super-polynomial time making it impossible for large enough integers. Shor’s algorithm is a well-known algorithm for factoring large integers in polynomial time and takes only O(b3) time and O(b) space on b-bit number inputs. Shor’s algorithm poses a potential threat to the current security system with the ongoing advancements of Quantum computers. This paper discusses how Shor’s algorithm will be able to break integer factorization-based cryptographic algorithms, for example, Rivest–Shamir–Adleman (RSA) and Rabin Algorithms. As a proof of concept, experimental analysis of Quantum Shor’s algorithm on existing public-key cryptosystems using IBM Quantum Experience is performed for factorizing integers of moderate length (seven bits) due to limitations of thirty-two qubits in present IBM quantum computers. In a nutshell, this work will demonstrate how Shor’s algorithm poses threat to confidentiality and authentication services.