Navigation
Topics Register • News • History • How to • Sequences statistics • Template prototypes

General number field sieve

提供: Prime-Wiki
移動先: 案内、 検索


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

「https://www.rieselprime.de/z/index.php?title=General_number_field_sieve&oldid=1267」から取得