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)
Abstract
no abstract
Conference Papers
Year : 1999
Paul Zimmermann : Connect in order to contact the contributor
https://hal.inria.fr/hal-00917753
Submitted on : Thursday, December 12, 2013-12:42:50 PM
Last modification on : Friday, February 4, 2022-3:34:55 AM
Dates and versions
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⟩
Collections
72
View
0
Download