Faster cofactorization with ECM using mixed representations - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Faster cofactorization with ECM using mixed representations

Résumé

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.
Fichier principal
Vignette du fichier
db_ecm (1).pdf (471.23 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-01951942 , version 1 (09-01-2019)

Identifiants

  • HAL Id : hal-01951942 , version 1

Citer

Cyril Bouvier, Laurent Imbert. Faster cofactorization with ECM using mixed representations. 2019. ⟨hal-01951942⟩
141 Consultations
255 Téléchargements

Partager

Gmail Facebook X LinkedIn More