Published Paper Details:

Information exchange on internet is increased in very high level because of this reason the security risk is also increased on the user's side. Cryptography is used to decrease the risk level. Public and private keys are the base of the Asymmetric cryptography. The time required for encryption and decryption improve the capability of information security. The foundation of public key cryptographic security therefore relies on this hardness of the RSA algorithm. This is a secure factorization based on modern classical cryptographic algorithms. Various techniques are available to find the numerical factors using different algorithms. The best-known set of techniques includes probabilistic integer factorization-based cryptography and geometric elliptic curve cryptography. Both techniques approach the factorization problem differently by generating at least one factor. This paper examines Pollard Rho and Lenstra's algorithm used to decompose integer factorization-based cryptography, finds the number factors, and compares the factorization times for different key lengths. The experimental results will be beneficial to recognize the impact of computation complexity implicated in factoring process of Pollard Rho as well as Lenstra algorithms regarding to time taken in each case.