| 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 |
Difference between revisions of "General number field sieve"
(new) |
(shortcut) |
||
| Line 1: | Line 1: | ||
| + | {{Shortcut|GNFS|General number field sieve: most efficient classical [[Factorization|factoring method]] for 100+ digit numbers.}} | ||
{{Stub}} | {{Stub}} | ||
The '''general number field sieve (GNFS)''' is the most efficient classical [[algorithm]] in [[number theory]] for [[Factorization|factoring]] [[integer]]s with 100+ [[digit]]s. | The '''general number field sieve (GNFS)''' is the most efficient classical [[algorithm]] in [[number theory]] for [[Factorization|factoring]] [[integer]]s with 100+ [[digit]]s. | ||
Latest revision as of 12:04, 19 February 2019
|
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.
