| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
General number field sieve
|
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.
