ECM using Edwards curves

D.J. Bernstein, P. Birkner, T. Lange, C.P. Peters

Research output: Contribution to journalArticleAcademicpeer-review

17 Citations (Scopus)

Abstract

This paper introduces EECM-MPFQ, a fast implementation of the elliptic-curve method of factoring integers. EECM-MPFQ uses fewer modular multiplications than the well-known GMP-ECM software, takes less time than GMP-ECM, and finds more primes than GMP-ECM. The main improvements above the modular-arithmetic level are as follows: (1) use Edwards curves instead of Montgomery curves; (2) use extended Edwards coordinates; (3) use signed-sliding-window addition-subtraction chains; (4) batch primes to increase the window size; (5) choose curves with small parameters and base points; (6) choose curves with large torsion.
Original languageEnglish
Pages (from-to)1139-1179
JournalMathematics of Computation
Volume82
Issue number282
DOIs
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'ECM using Edwards curves'. Together they form a unique fingerprint.

Cite this