Number Field Sieve

The asymptotically fastest known classical integer factorization algorithm for very large integers, which uses algebraic number fields, polynomial selection, sieving of norms and large-scale linear algebra to produce relations that yield congruences of squares modulo n.