Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4289
Title: | A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem |
Authors: | MAHALANOBIS, AYAN MALLICK, VIVEK MOHAN Abdullah, Ansari Dept. of Mathematics |
Keywords: | Elliptic curve discrete logarithm problem Mathematics 2018 |
Issue Date: | Dec-2018 |
Publisher: | Springer Nature |
Citation: | International Conference on Cryptology in India: Progress in Cryptology - INDOCRYPT, 215-227. |
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. |
URI: | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4289 |
Appears in Collections: | BOOK CHAPTERS |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.