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

From Prime-Wiki
Revision as of 15:58, 12 February 2019 by Karbon (talk | contribs) (new)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Logo.svg 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

Retrieved from "https://www.rieselprime.de/z/index.php?title=General_number_field_sieve&oldid=1021"