special number field sieve

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/

<< Previous

Word Browser

Next >>

lovech province
vw pointer
vidin province
vratsa province
eric coates
ernest fenollosa
gabrovo province
vw gol
beauce sartigan regional county municipality, quebec
turnovo
temporal logic in finite state verification

ruse province
turgovishte province
sliven province
razgrad province
yambol province
france and weapons of mass destruction
the three degrees
david agnew
china and weapons of mass destruction
click here
montana province

lumpsucker
kick the can
kurt hirsch
3908 nyx
maurice kendall
treaty of bucharest, 1913
tabby cat (solitaire)
mool mantra
pleven province
poire z
chadinga conservation reserve

therebucks
chenjerai hove
tristan honsinger
borbetomagus
timothy (tortoise)
frank morley
peter engel
second life
christian coalition (new zealand)
george salmon
vbulletin