Cryptology ePrint Archive: Report 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.

Category / Keywords: elliptic curves, discrete logarithm problem, multiplicative orders, Pollard's lambda, Pollard's rho

Date: received 28 Apr 2018, last revised 1 May 2018

Contact author: sgrebnev at hse ru

Available format(s): PDF | BibTeX Citation

Note: Fixed some minor typography details

Version: 20180502:060821 (All versions of this report)

Short URL: ia.cr/2018/399


[ Cryptology ePrint archive ]