Skip to search formSkip to main contentSkip to account menu

General number field sieve

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, considering different curve forms… 
2017
2017
The bound to factor large integers is dominated by the computational effort to discover numbers that are smooth, typically… 
2008
2008
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefore widely used for encrypting… 
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… 
2002
2002
We report the factorization of a 135-digit integer by the triple-large-prime variation of the multiple polynomial quadratic sieve… 
1995
1995
There are many cryptographic protocols the security of which depends on the difficulty of solving the discrete logarithm problem… 
1994
1994
ii An experimen t t o stud y th e effec t o f seaso n an d shrub-gras s combinations o n th e fodde r qualit y o f leucaen a… 
1993
1993
During growth of Ricinus communis seedlings, magnesium ions are mobilized in the endosperm, taken up by and accumulated to very… 
1977
1977
Following birth there are changes in glomerular morphology and function reflected by an increased glomerular filtration rate (GFR…