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
    • 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 RSA-130 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. AMontgomery-lik 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. Lenstraet 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...

    Jean-Marc 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. LENSTRAet al. The number field sieve

Sort by: