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) - Archive ouverte HAL Access content directly
Conference Papers Year : 1999

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)

(1)
1

Abstract

no abstract
Not file

Dates and versions

hal-00917753 , version 1 (12-12-2013)

Identifiers

  • HAL Id : hal-00917753 , version 1

Cite

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⟩
72 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More