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 on 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. The algorithm has no restriction on the finite field over which the elliptic curve is defined.
Author supplied keywords
Cite
CITATION STYLE
Mahalanobis, A., Mallick, V. M., & Abdullah, A. (2018). A las vegas algorithm to solve the elliptic curve discrete logarithm problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11356 LNCS, pp. 215–227). Springer Verlag. https://doi.org/10.1007/978-3-030-05378-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
