The Number Field Sieve

One of the most important and widely-studied questions in computational number theory is how to efficiently compute the prime factorizations of large integers, and there is no algorithm which can factor n in polynomial time with respect to log n.