On the Feasibility of an ECDLP Algorithm

Sergey Grebnev

Paper 2018/399 Original: eprint.iacr.org/2018/399 ↗

On the Feasibility of an ECDLP Algorithm

Sergey Grebnev

Abstract

We study the properties of an algorithm for solving the elliptic curve discrete logarithm problem presented by A.~Yu.~Nesterenko at the CTCrypt 2015 session. We show that for practically important instances of the problem its average complexity is not less than that of Pollard's rho-method.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2018-05-02: last updated; 2018-05-02: published
Short URL: https://ia.cr/2018/399
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2018/399,
      author = {Sergey Grebnev},
      title = {On the Feasibility of an ECDLP Algorithm},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/399},
      year = {2018},
      url = {https://eprint.iacr.org/2018/399}
}