In number theory, a branch of mathematics, the special number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from it.
The special number field sieve is efficient for integers of the form re ± s, where r and s are small (for instance Mersenne numbers).
Heuristically, its complexity for factoring an integer is of the form:
in O and L-notations.
The SNFS has been used extensively by NFSNet (a volunteer distributed computing effort), NFS@Home and others to factorise numbers of the Cunningham project; for some time the records for integer factorisation have been numbers factored by SNFS.
Read more about Special Number Field Sieve: Overview of Method, Details of Method, Choice of Parameters, Limitations of Algorithm
Famous quotes containing the words special, number, field and/or sieve:
“The treatment of the incident of the assault upon the sailors of the Baltimore is so conciliatory and friendly that I am of the opinion that there is a good prospect that the differences growing out of that serious affair can now be adjusted upon terms satisfactory to this Government by the usual methods and without special powers from Congress.”
—Benjamin Harrison (1833–1901)
“I who have been involved with all styles of painting can assure you that the only things that fluctuate are the waves of fashion which carry the snobs and speculators; the number of true connoisseurs remains more or less the same.”
—Pablo Picasso (1881–1973)
“Frankly, I’d like to see the government get out of war altogether and leave the whole field to private industry.”
—Joseph Heller (b. 1923)
“They went to sea in a Sieve, they did,
In a Sieve they went to sea:
In spite of all their friends could say,
On a winter’s morn, on a stormy day,”
—Edward Lear (1812–1888)