You are looking at a specific version 20180207:175601 of this paper. See the latest version.

Paper 2018/134

A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem

Ayan Mahalanobis and Vivek Mallick

Abstract

In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm. The algorithm that we describe has some similarities with the most powerful index-calculus algorithm for the discrete logarithm problem over a finite field.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Elliptic curve discrete logarithm problem
Contact author(s)
ayanm @ iiserpune ac in
History
2018-02-07: received
Short URL
https://ia.cr/2018/134
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.