The special number field sieve, SNFS, is a special-purpose integer factorization algorithm in number theory. The general number field sieve was derived from it. It is efficient for integers of the form a times b to the power n plus c, where a, b and c have small absolute values, for example Mersenne numbers. Heuristically its complexity for factoring n is of the form L sub n of one third and the cube root of 32 over 9. Volunteer efforts such as NFSNet and NFS@Home have used it extensively on numbers of the Cunningham project, and for some time the records for integer factorization were numbers factored by SNFS.
Connections
In Field
Source Special number field sieve (Wikipedia)
Sources
Special number field sieve (Wikipedia)
In Group: Number Theory and Primality, Lead
the special number field sieve (SNFS) is a special-purpose integer factorization algorithm.
In Field: Algorithms and Complexity Theory, Lead [in-field]
In number theory, a branch of mathematics, the special number field sieve (SNFS)
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.