General number field sieve

Known as: Number field sieve, Sieving with large primes, GNFS 
In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
0102019902017

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?
2006
2006
The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In 1990, the ninth Fermat number was factored into primes by means of a new algorithm, the "number field sieve", which was… (More)
Is this relevant?
2005
2005
We describe the main ideas underlying integer factorization using the number field sieve. 
Is this relevant?
2003
2003
RSA is a very popular public key cryptosystem. This algorithm is known to be secure, but this fact relies on the difficulty of… (More)
  • table I
  • figure 1
  • table III
Is this relevant?
1998
1998
With the proliferation of computers into homes and businesses and the explosive growth rate of the Internet, the ability to… (More)
  • table 1.1
  • table 5.1
  • table 5.2
  • table 5.3
  • table 5.4
Is this relevant?
1996
1996
The diiculty in solving the discrete logarithm problem is of extreme cryptographic importance since it is widely used in… (More)
Is this relevant?
1993
1993
It was shown in 2] that under reasonable assumptions the general number eld sieve (GNFS) is the asymptotically fastest known… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The number field sieve is an algorithm to factor integers of the form r e ± s for small positive r and s . This note is intended… (More)
Is this relevant?