Paper 2018/669
Faster cofactorization with ECM using mixed representations
Cyril Bouvier and Laurent Imbert
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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- factoringElliptic Curve Methodcofactorizationdouble-base representationtwisted Edwards curveMontgomery curveCADO-NFS
- Contact author(s)
- laurent imbert @ lirmm fr
- History
- 2018-10-01: last of 3 revisions
- 2018-07-13: received
- See all versions
- Short URL
- https://ia.cr/2018/669
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/669,
author = {Cyril Bouvier and Laurent Imbert},
title = {Faster cofactorization with ECM using mixed representations},
howpublished = {Cryptology ePrint Archive, Paper 2018/669},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/669}},
url = {https://eprint.iacr.org/2018/669}
}
