Quantum computers evolve too much in this era that now we can think of decrypting the most used encrypted algorithm of the internet that is RSA Algorithm. A system for quick factoring of large numbers and related topics for deciphering messages or documents based on the quantity algorithm of Shor. In the field of quantum computing there is a very important algorithm which is known as Shor’s algorithm. This algorithm helps to find the prime factor of any number. The factorization of any large integer is not possible in classical computer in finite time, while Peter Shor suggested a polynomial time factorization algorithm that could do the prime factorization. This paper discuss about the modification in Shor’s algorithm to increase the probability of success to get the two factors of RSA algorithm. © 2021, Research Publication. All rights reserved.