Welcome to the resource topic for 2018/134
Title:
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
Authors: 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.
ePrint: https://eprint.iacr.org/2018/134
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .