Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Special number field sieve

Known as: SNFS 
In number theory, a branch of mathematics, the special number field sieve (SNFS) is a special-purpose integer factorization algorithm. The general… Expand
Wikipedia

Related topics

Related topics

15 relations
Algorithmic efficiencyComputational complexity theoryDistributed computingGeneral number field sieve
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Tower Number Field Sieve
The security of pairing-based crypto-systems relies on the difficulty to compute discrete logarithms in finite fields $${\mathbb… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Factorization of a 1061-bit number by the Special Number Field Sieve
I provide the details of the factorization of the Mersenne number 2 1061 1 by the Special Number Field Sieve. Although this… Expand
Is this relevant?
2011
2011
Experimental Evidence for a Reduced Metal-saturated Upper Mantle
The uppermost mantle as sampled by xenoliths, peridotite massifs and primitive basaltic melts appears to be relatively oxidized… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Special number field sieve
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefore widely used for encrypting… Expand
Is this relevant?
2007
2007
A Kilobit Special Number Field Sieve Factorization
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number… Expand
Is this relevant?
2007
2007
AMSR-E Data Resampling With Near-Circular Synthesized Footprint Shape and Noise/Resolution Tradeoff Study
An improved Backus-Gilbert resampling scheme is developed and applied on Advanced Microwave Scanning Radiometer-EOS (AMSR-E… Expand
  • table I
  • table II
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as Σ w i=1 ∈ i 2 ci , with ∈ 1 ,..., ∈ w… Expand
  • figure 3.11
  • figure 3.15
Is this relevant?
2002
2002
The Special Function Field Sieve
Let p be a prime number and n a positive integer, and let q=pn. Adleman and Huang [Inform. and Comput., 151 (1999), pp. 5--16… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Function Field Sieve Is Quite Special
In this paper, we describe improvements to the function field sieve (FFS) for the discrete logarithm problem in Fpn, when p is… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE