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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2017
024619912017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The security of pairing-based crypto-systems relies on the difficulty to compute discrete logarithms in finite fields Fpn where n… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
In this paper, we extend the tower number field sieve (TNFS) proposed by Barbulescu, Gaudry, and Kleinjung in Asaicrypt 2015. Our… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2015
2015
The general number sieve is the most efficient algorithm known integer factorization, it consists of polynomial selection… (More)
Is this relevant?
2013
2013
In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
I provide the details of the factorization of the Mersenne number 21061 − 1 by the Special Number Field Sieve. Although this… (More)
Is this relevant?
Review
2012
Review
2012
We review several methods for the square root step of the Number Field Sieve, and present an original one, based on the Chinese… (More)
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number… (More)
  • table 4
  • table 5
  • table 6
  • table 7
  • figure 6
Is this relevant?
2007
2007
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number… (More)
Is this relevant?
2006
2006
We define the weight of an integer N to be the smallest w such that N can be represented as ∑w i=1 i2 ci , with 1, . . . , w ∈ {1… (More)
  • figure 3.11
  • figure 3.15
Is this relevant?
2002
2002
In this paper, we describe improvements to the function field sieve (FFS) for the discrete logarithm problem in Fpn , when p is… (More)
Is this relevant?