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

2017/03/22 by Ayan Mahalanobis, Vivek Mallick, Vivek Mohan Mallick · 1 voice
Computer Science · #Cryptography and Residue Arithmetic #Polynomial and algebraic computation #Coding theory and cryptography

paper · pdf · doi:10.13140/rg.2.2.22661.86249

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.

Discussions

• A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem [pdf] [hn, 90 points, 27 comments]

Related

• New algorithm for the discrete logarithm problem on elliptic curves
• Minors solve the elliptic curve discrete logarithm problem
• A New Method for Geometric Interpretation of Elliptic Curve Discrete Logarithm Problem
• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
• A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic