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
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00419094
Contributor : Alexander Kruppa <>
Submitted on : Tuesday, September 22, 2009 - 4:03:45 PM
Last modification on : Thursday, January 11, 2018 - 6:21:04 AM
Long-term archiving on : Tuesday, October 16, 2012 - 11:10:45 AM

File

RR-7041.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00419094, version 1

Collections

Citation

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

Share

Metrics

Record views

397

Files downloads

269