Faster cofactorization with ECM using mixed representations

Cyril Bouvier 1 Laurent Imbert 2
2 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This paper introduces a novel implementation of the elliptic curve factoring method specifically designed for medium-size integers such as those arising by billions in the cofactorization step of the Number Field Sieve. In this context, our algorithm requires fewer modular multiplications than any other publicly available implementation. The main ingredients are: the use of batches of primes, fast point tripling, optimal double-base decompositions and Lucas chains, and a good mix of Edwards and Montgomery representations.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download
Contributor : Laurent Imbert <>
Submitted on : Wednesday, January 9, 2019 - 9:45:34 AM
Last modification on : Tuesday, January 22, 2019 - 1:16:06 AM


  • HAL Id : hal-01951942, version 1



Cyril Bouvier, Laurent Imbert. Faster cofactorization with ECM using mixed representations. 2019. ⟨hal-01951942⟩



Record views


Files downloads