A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
Cryptography and Security
2018-02-06 v3 Information Theory
Algebraic Geometry
math.IT
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.
Cite
@article{arxiv.1703.07544,
title = {A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem},
author = {Ayan Mahalanobis and Vivek Mallick},
journal= {arXiv preprint arXiv:1703.07544},
year = {2018}
}