Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,867,659 papers from all fields of science
Search
Sign In
Create Free Account
General number field sieve
Known as:
Number field sieve
, NFSNET
, Sieving with large primes
Expand
In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10100…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Algorithm
Algorithmic efficiency
Arjen Lenstra
Block Wiedemann algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Gene-Network-Based Feature Set (GNFS) for Expression-Based Cancer Classification
Narumol Doungpan
,
W. Engchuan
,
A. Meechai
,
S. Fong
,
Jonathan H. Chan
2016
Corpus ID: 63234274
2015
2015
Improving on the Number Field Sieve
Per Kristian Ørke
2015
Corpus ID: 124220648
We look at efficient methods for computing logarithms in finite fields of any type. To achieve this, we first develop methods for…
Expand
2015
2015
A construction of 3-dimensional lattice sieve for number field sieve over F_{p^n}
Kenichiro Hayasaka
,
Kazumaro Aoki
,
Tetsutaro Kobayashi
,
T. Takagi
IACR Cryptology ePrint Archive
2015
Corpus ID: 11172941
The security of pairing-based cryptography is based on the hardness of solving the discrete logarithm problem (DLP) over…
Expand
2008
2008
Special number field sieve
P. Bohler
2008
Corpus ID: 116899986
Integer factorization is a problem not yet solved for arbitrary integers. Huge integers are therefore widely used for encrypting…
Expand
2008
2008
The impact of the number field sieve on the discrete logarithm problem in finite fields
Oliver Schirokauer
2008
Corpus ID: 16299235
Let p be a prime number and n a positive integer, and let q D p. Let Fq be the field of q elements and denote by F q the…
Expand
2002
2002
The Special Function Field Sieve
Oliver Schirokauer
SIAM Journal on Discrete Mathematics
2002
Corpus ID: 43454993
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
2002
2002
Combinatorial enumeration of ragas (scales of integer sequences) of Indian music
K. Balasubramanian
2002
Corpus ID: 122424882
It is shown that a combinatorial method based on the principle of inclusion and exclusion (Sieve formula) yields generating…
Expand
1995
1995
Factoring Integers Using the Web and the Number Field Sieve
A. Lenstra
1995
Corpus ID: 37140599
This note provides background on the www-factoring project, which was started in the fall of 1995. Factoring a positive integer…
Expand
1994
1994
The effect of season and shrub-grass combination on the fodder quality of three agroforestry plant species grown in Maseno, Western Kenya
Edward K. Mengich
1994
Corpus ID: 131111275
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…
Expand
1992
1992
The number field sieve (NFS), Sec. 5.1.3
H. Lenstra
1992
Corpus ID: 60656118