The 'Lenstra Elliptic Curve Factorization' (ECM) is most effective for:
Finding small prime factors (up to 50-60 digits)
Factoring RSA keys with large random primes
Proving primality of 1000-digit numbers
Quantum computers only