Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Authors
(176)
Arjen K. Lenstra
19
Peter L. Montgomery
8
Rainer Steinwandt
7
Willi Geiselmann
7
Hendrik W. Lenstra
7
Conferences
(22)
CRYPTO
8
ANTS
8
ASIACRYPT
6
CHES
5
EUROCRYPT
5
Journals
(26)
Math. Comput.
6
JOC
4
DCC
3
CORR
3
EXPERT
1
Keywords
(10)
Subscribe
Academic
Keywords
Number Field Sieve
NFS,Number Field Sieve,Number Field Sieving
Number Field Sieve  NFS
Publications: 139

Citation Count: 1,604
Stemming Variations:
Number Field Sieving
Cumulative
Annual
Definition Context
(4)
The Number Field Sieve (NFS) is the asymptotically fastest factoring algorithm known. It had spectacular successes in factoring numbers of a special form. Then the method was adapted for general numbers, and recently applied to the RSA130 number (6), setting a new world record in factorization. The NFS has undergone several modications since its appearance. One of these modications concerns the last stage: the computation of the square root of a huge algebraic number given as a product of hundreds of thousands of small ones...
Phong Nguyen
.
AMontgomerylik eSquar eRoo tfo rthe Number Field Sieve
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 as a 'report on work in progress' on this algorithm...
Arjen K. Lenstra
,
et al.
The number field sieve
The number field sieve is a method proposed by Lenstra, Lenstra, Manasse and Pollard for integer factorization (this volume, pp. 11–42). A heuristic analysis indicates that this method is asymptotically faster than any other existing one. It has had spectacular successes in factoring numbers of a special form...
JeanMarc Couveignes
.
Computing a square root for the number field sieve
The number field sieve is an algorithm to factor integers of the form r e − s for small positive r and s. The algorithm depends on arithmetic in an algebraic number field...
A. K. LENSTRA
,
et al.
The number field sieve
Sort by:
Publications
(139)
An
Andreas Enge
,
Pierrick Gaudry
,
Emmanuel Thomé
Journal:
Journal of Cryptology  JOC
, vol. 24, no. 1, pp. 2441, 2011
One approach to factorization of positive integers
A. A. Boiko
,
D. B. Ziyatdinov
,
Sh. T. Ishmukhametov
Journal:
Russian Mathematics
, vol. 55, no. 4, pp. 1217, 2011
On nonlinear polynomial selection for the number field sieve
Nicholas Coxon
Published in 2011.
Integer Factorization Methods
Stephanie Faith Vergara
Published in 2011.
An Improvement to the Number Field Sieve
Qizhi Zhang
Journal:
Computing Research Repository  CORR
, vol. abs/1103.1, 2011