2000 character limit reached
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem (1703.07544v3)
Published 22 Mar 2017 in cs.CR, cs.IT, math.AG, and 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.