Note: Due to changes in the Riesel prime template, most of those pages (and related) are not shown properly.This will take some time! Wanna help? Please move any Riesel prime page first, then edit/add the base parameter. |

**Navigation**

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