A Probabilistic Baby-step Giant-step Algorithm

MAHALANOBIS, AYAN; Kushwaha, Prabhat

dc.contributor.author	Kushwaha, Prabhat	en_US
dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.coverage.spatial	-	en_US
dc.date.accessioned	2019-07-01T05:37:43Z
dc.date.available	2019-07-01T05:37:43Z
dc.date.issued	2017-07	en_US
dc.identifier.citation	Proceedings of the 14th International Joint Conference on e-Business and Telecommunications, 6: SECRYPT, 401-406.	en_US
dc.identifier.isbn	9789897582592	en_US
dc.identifier.issn	-	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3355
dc.identifier.uri	https://www.scitepress.org/Link.aspx?doi=10.5220/0006396304010406	en_US
dc.description.abstract	In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are considered to be the most conservative and safest curves among all NIST curves.	en_US
dc.language.iso	en	en_US
dc.publisher	Science and Technology Publications	en_US
dc.subject	Discrete Logarithm Problem	en_US
dc.subject	Baby-step	en_US
dc.subject	Giant-step Algorithm	en_US
dc.subject	NIST Curves	en_US
dc.subject	Over Prime Fields	en_US
dc.subject	Parallelized Collision Search	en_US
dc.subject	2017	en_US
dc.title	A Probabilistic Baby-step Giant-step Algorithm	en_US
dc.type	Conference Papers	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.doi	https://doi.org/10.5220/0006396304010406	en_US
dc.identifier.sourcetitle	Proceedings of the 14th International Joint Conference on e-Business and Telecommunications	en_US
dc.publication.originofpublisher	Foreign	en_US