# 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.

From Prime-Wiki

Jump to: navigation, search

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.

- This page was last edited on 19 February 2019, at 12:04.
- This page has been accessed 338 times.
- Content is available under Creative Commons 3.0 unless otherwise noted.