General number field sieve

From Prime-Wiki
Jump to: navigation, search


Gimps.gif This article is only a stub. You can help PrimeWiki by expanding it.

The general number field sieve (GNFS) is the most efficient classical algorithm in number theory for factoring integers with 100+ digits.

See also

External links