GMP-ECM: yet another implementation of the Elliptic Curve Method (or how to find a 40-digit prime factor within 2 * 10^11 modular multiplications)

Paul Zimmermann

Conference papers

GMP-ECM: yet another implementation of the Elliptic Curve Method (or how to find a 40-digit prime factor within 2 * 10^11 modular multiplications)

Paul Zimmermann ¹

1 POLKA - Polynomials, Combinatorics, Arithmetic

INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications

Résumé : no abstract

Document type :

Conference papers

Domain :

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

Complete list of metadatas

https://hal.inria.fr/hal-00917753
Contributor : Paul Zimmermann <>
Submitted on : Thursday, December 12, 2013 - 12:42:50 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

GMP-ECM: yet another implementation of the Elliptic Curve Method (or how to find a 40-digit prime factor within 2 * 10^11 modular multiplications)

Identifiers

Collections

Citation

Export

Metrics

142

Contact Legal Notice Personal Data

GMP-ECM: yet another implementation of the Elliptic Curve Method (or how to find a 40-digit prime factor within 2 * 10^11 modular multiplications)

Identifiers

Collections

Citation

Export

Share

Metrics

142

Contact Legal Notice Personal Data