Editing General number field sieve (section)

== Implementations ==<!-- linked from [[NFSNet]] -->
Some implementations focus on a certain smaller class of numbers. These are known as [[special number field sieve]] techniques, such as used in the [[Cunningham project]].
A project called NFSNET ran from 2002<ref>{{cite web |title= NFSNET: the first year |author= Paul Leyland |work= Presentation at EIDMA-CWI Workshop on Factoring Large Numbers |date= December 12, 2003 |url= http://homepages.cwi.nl/~herman/Leyland.ppt |access-date= August 9, 2011 }}</ref> through at least 2007. It used volunteer distributed computing on the [[Internet]].<ref>{{cite web |title= Welcome to NFSNET |date= April 23, 2007 |url-status= dead |url= http://www.nfsnet.org/ |archive-url= https://web.archive.org/web/20071022032617/http://www.nfsnet.org/ |archive-date= October 22, 2007 |access-date= August 9, 2011 }}</ref>
[[Paul Leyland]] of the [[United Kingdom]] and Richard Wackerbarth of Texas were involved.<ref>{{cite web |title=About NFSNET |url-status= dead |url= http://www.nfsnet.org/aboutus.html |archive-url= https://web.archive.org/web/20080509131653/http://www.nfsnet.org/aboutus.html |archive-date= May 9, 2008 |access-date= August 9, 2011 }}</ref>

Until 2007, the gold-standard<!-- mathematical term?? --> implementation was a suite of software developed and distributed by [[Centrum Wiskunde & Informatica|CWI]] in the Netherlands, which was available only under a relatively restrictive license.{{Citation needed|date=March 2017}} In 2007, [[Jason Papadopoulos]] developed a faster implementation of final processing as part of msieve, which is in the public domain.  Both implementations feature the ability to be distributed among several nodes in a cluster with a sufficiently fast interconnect.

Polynomial selection is normally performed by [[GPL]] software written by Kleinjung, or by msieve, and lattice sieving by GPL software written by Franke and Kleinjung; these are distributed in GGNFS.
* [http://escatter11.fullerton.edu/nfs/ NFS@Home]
* [http://www.math.ttu.edu/~cmonico/software/ggnfs/ GGNFS]
* [https://sourceforge.net/projects/factor-by-gnfs/ factor by gnfs]
* [http://cado-nfs.inria.fr/ CADO-NFS]
* [http://sourceforge.net/projects/msieve/ msieve] (which contains final-processing code, a polynomial selection optimized for smaller numbers and an implementation of the line sieve)
* [http://kmgnfs.cti.gr kmGNFS]