HackerPapers

arXiv:1703.07544cs.CR

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

Ayan Mahalanobis, Vivek Mallick

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
Journal reference
DOI
doi:10.13140/RG.2.2.22661.86249
Subjects
cs.CRCryptography and Security cs.ITInformation Theory math.AGAlgebraic Geometry

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Apr 2017 to Apr 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.