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
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
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

Identifiers

  • HAL Id : hal-00917753, version 1

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

Paul Zimmermann. 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). Foundations of Computational Mathematics, 1999, Oxford, United Kingdom. ⟨hal-00917753⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

140

Contact


archive-ouverte@inria.fr