You are looking at a specific version 20180502:060821 of this paper.
See the latest version.
Paper 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.
Note: Fixed some minor typography details
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- elliptic curvesdiscrete logarithm problemmultiplicative ordersPollard's lambdaPollard's rho
- Contact author(s)
- sgrebnev @ hse ru
- History
- 2018-05-02: received
- Short URL
- https://ia.cr/2018/399
- License
-
CC BY
