Analysis of Quantum Algorithm to Find the Solution of Integer factoriza-tion Problem

Quantum computing has emerged as an important interdisciplinary field, merging theories in mathematics, physics and computer science. So far, a significant portion of research in quantum computing has focused on the design of quantum algorithms. Quantum Com-puters requires very different algorithms for factorization, which plays an important role in the field of quantum computing and shor’s algo-rithm is used to address integer factorization problem. Shor's algorithm is important because it breaks a widely used public-key cryptography scheme known as RSA. This paper discusses the refinement of quantum factorization algorithm. Keywords: - quantum algorithm, factorization, gcd, prime decomposition, shor’s algorithm.