Factoring Large Integers with the Number Field Sieve
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    With the Fermat numbers F7 and F9 being factored into primes, a new algorithm, the number field sieve, is given, which was proposed by Pollard. Manasse and Pollard investigate this algorithm thoroughly, and develop it from the special number field sieve (SNFS) to the general number field sieve (GNFS). In this paper, we describe the new algorithm and explain the NFS implementation.

    Reference
    Related
    Cited by
Get Citation

Ni Guyan. Factoring Large Integers with the Number Field Sieve[J]. Journal of National University of Defense Technology,1998,20(4):103-108.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 05,1997
  • Revised:
  • Adopted:
  • Online: January 03,2014
  • Published:
Article QR Code