Prime Factorization without Using Any Approximations

Factoring number is a non-trivial operation, and that fact is the source of a lot of cryptographic algorithms. Many cryptosystems are based on the factorization of large integers. In this paper, factorization algorithm based on number theory is proposed and get the exact prime factorization without any approximations. The major advantages of the proposed method are listed and the disadvantages of the existing factorization algorithm based on square root; approximation are highlighted. The time complexity of the proposed method is less because there is no recursive steps in this proposed algorithm.