A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem

dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.contributor.author	MALLICK, VIVEK MOHAN	en_US
dc.contributor.author	Abdullah, Ansari	en_US
dc.date.accessioned	2019-12-24T12:20:26Z
dc.date.available	2019-12-24T12:20:26Z
dc.date.issued	2018-12	en_US
dc.identifier.citation	International Conference on Cryptology in India: Progress in Cryptology - INDOCRYPT, 215-227.	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/4289
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Springer Nature	en_US
dc.subject	Elliptic curve discrete logarithm problem	en_US
dc.subject	Mathematics	en_US
dc.subject	2018	en_US
dc.title	A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem	en_US
dc.type	Book Chapter	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.doi	https://doi.org/10.1007/978-3-030-05378-9_12	en_US
dc.publication.originofpublisher	Foreign	en_US