Study on Implementation of Shor’s Factorization Algorithm on Quantum Computer

The fundamental security aspect of the classical crypto-system depends on integer factorization and discrete logarithm problems. The quantum factorization problem is a crucial problem in quantum computing as it has significant implications for cryptography and security. Shos’s paper on “Polynomial-time algorithms for discrete logarithms and factoring on a quantum compute” has become a threat to the classical crypto-system, influencing many researchers to work on factorization problems using quantum computing. Quantum Computers (QC) can be essential in running different factorization algorithms in polynomial time. However, practical implementation on larger numbers is still a major challenge due to the requirement for error correction and massive quantum devices. Although the quantum factorization issue puts traditional cryptographic systems at risk, it also opens up new possibilities for quantum communication and encryption. The challenge of factorization opens up an entirely new field for research into quantum communication protocol security, including quantum key distribution and the development of quantum-resistant cryptographic systems. This paper surveys the various quantum algorithms for factoring a number into prime integers. We present a simulation study of the Quantum factorization algorithm to determine the period of a process. Turning the factoring problem into the challenge of determining a function’s period is the essential strategy of practical implementation using the quantum circuit.