Welcome to the resource topic for 2018/399
Title:
On the Feasibility of an ECDLP Algorithm
Authors: 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.
ePrint: https://eprint.iacr.org/2018/399
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 .