Science Fair Project Encyclopedia

Science Fair Project Encyclopedia Contents Page

Categories: Integer factorization algorithms | Number theory

Special number field sieve

(Redirected from NFSNET)

The special number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from it. When the term "number field sieve" is used without qualification, it refers to GNFS.

The special number field sieve is efficient for integers of the form r^e ± s, where r and s are small. As such, it is ideal for factoring Fermat numbers.

Its running time, in asymptotic notation, is:

$\Theta\left(\exp\left( \left(\frac{32}{9}n\right)^{\frac{1}{3}} (\log n)^{\frac{2}{3}} \right)\right).$

The SNFS has been used extensively by NFSNET (a volunteer distributed computing effort) and others to factorise numbers of the Cunningham project.

External links

http://www.nfsnet.org/

Categories: Integer factorization algorithms | Number theory

Science Fair Project Encyclopedia Contents Page

10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details

All Science Fair Projects