Welcome to the resource topic for 2018/669
Title:
Faster cofactorization with ECM using mixed representations
Authors: Cyril Bouvier, 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.
ePrint: https://eprint.iacr.org/2018/669
Talk: https://www.youtube.com/watch?v=5tTKNHsHzxA
Slides: https://iacr.org/submit/files/slides/2020/pkc/pkc2020/112/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .