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

*Ayan Mahalanobis and 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.

**Category / Keywords: **public-key cryptography / Elliptic curve discrete logarithm problem

**Date: **received 5 Feb 2018

**Contact author: **ayanm at iiserpune ac in

**Available format(s): **PDF | BibTeX Citation

**Version: **20180207:175601 (All versions of this report)

**Short URL: **ia.cr/2018/134

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]