Paper 2016/1092

Parametrizations for Families of ECM-friendly curves

Alexandre Gélin, Thorsten Kleinjung, and Arjen K. Lenstra

Abstract

We provide a new family of elliptic curves that results in a one to two percent performance improvement of the elliptic curve integer factorization method. The speedup is confirmed by extensive tests for factors ranging from 15 to 63 bits.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
Factorizationelliptic curvesECM
Contact author(s)
alexandre gelin @ uvsq fr
History
2018-06-11: last of 2 revisions
2016-11-22: received
See all versions
Short URL
https://ia.cr/2016/1092
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/1092,
      author = {Alexandre Gélin and Thorsten Kleinjung and Arjen K.  Lenstra},
      title = {Parametrizations for Families of ECM-friendly curves},
      howpublished = {Cryptology ePrint Archive, Paper 2016/1092},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/1092}},
      url = {https://eprint.iacr.org/2016/1092}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.