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 : 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 :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02613652
Contributor : Laurent Imbert <>
Submitted on : Wednesday, May 20, 2020 - 11:41:34 AM
Last modification on : Thursday, May 21, 2020 - 1:38:01 AM

Identifiers

Collections

Citation

Cyril Bouvier, Laurent Imbert. Faster Cofactorization with ECM Using Mixed Representations. IACR International Conference on Public-Key Cryptography (PKC), Jun 2020, Virtual, United Kingdom. pp.483-504, ⟨10.1007/978-3-030-45388-6_17⟩. ⟨lirmm-02613652⟩

Share

Metrics

Record views

41

Files downloads

74