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

Ayan Mahalanobis; Vivek Mallick

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

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

Ayan Mahalanobis

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.
History: 2018-02-07: last updated; 2018-02-07: published
Short URL: https://ia.cr/2018/134
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2018/134,
      author = {Ayan Mahalanobis and Vivek Mallick},
      title = {A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/134},
      year = {2018},
      url = {https://eprint.iacr.org/2018/134}
}