Skip to Main content Skip to Navigation
New interface
Reports (Research report)

A Software Implementation of ECM for NFS

Alexander Kruppa 1 
1 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The Elliptic Curve Method (ECM) of factorization can be used in the relation collection phase of the Number Field Sieve (NFS) to help identify smooth integers. This requires rapidly finding small prime factors for a large number of composites, each of a few machine words in size. We present a software implementation of ECM that is optimized for high throughput operation and compare it with recently proposed hardware implementations of ECM.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Alexander Kruppa Connect in order to contact the contributor
Submitted on : Tuesday, September 22, 2009 - 4:03:45 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:51 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 11:10:45 AM


Files produced by the author(s)


  • HAL Id : inria-00419094, version 1



Alexander Kruppa. A Software Implementation of ECM for NFS. [Research Report] RR-7041, INRIA. 2009. ⟨inria-00419094⟩



Record views


Files downloads