Skip to Main content Skip to Navigation
Conference papers

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 : In this talk, we introduce 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 :
Conference papers
Complete list of metadata
Contributor : Laurent Imbert Connect in order to contact the contributor
Submitted on : Wednesday, October 9, 2019 - 11:33:10 AM
Last modification on : Friday, August 5, 2022 - 3:02:58 PM


Files produced by the author(s)


  • HAL Id : lirmm-02309390, version 1


Cyril Bouvier, Laurent Imbert. Faster cofactorization with ECM using mixed representations. WRAC'H: Workshop on Randomness and Arithmetics for Cryptography on Hardware, Apr 2019, Roscoff, France. ⟨lirmm-02309390⟩



Record views


Files downloads