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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Argumentative text has been analyzed both theoretically and computationally in terms of argumentative structure that consists of… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
Highly Cited
2015
Highly Cited
2015
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
2013
2013
In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise… Expand
2012
2012
I provide the details of the factorization of the Mersenne number 2 1061 1 by the Special Number Field Sieve. Although this… Expand
2008
2008
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefore widely used for encrypting… Expand
Highly Cited
2007
Highly Cited
2007
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number… Expand
2007
2007
  • H. Gu, A. England
  • IEEE Transactions on Geoscience and Remote…
  • 2007
  • Corpus ID: 28268159
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
Highly Cited
2002
Highly Cited
2002
  • E. Thomé
  • J. Symb. Comput.
  • 2002
  • Corpus ID: 14049874
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences… Expand
  • table 1
  • table 2
Highly Cited
2002
Highly Cited
2002
In this paper, we describe improvements to the function field sieve (FFS) for the discrete logarithm problem in Fpn, when p is… Expand
2002
2002
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