Integer Factorization using Elliptic Curves

Lenstra’s algorithm is the fastest algorithm that relies on the smallest prime divisor of a given composite integer and can be significantly faster if the number in question has a small prime factor.