A new method for solving the elliptic curve discrete logarithm problem

Ansari Abdullah; MALLICK, VIVEK MOHAN; MAHALANOBIS, AYAN

DR Home
→
PUBLICATIONS & PATENTS
→
JOURNAL ARTICLES
→
View Item

dc.contributor.author	Ansari Abdullah	en_US
dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.contributor.author	MALLICK, VIVEK MOHAN	en_US
dc.date.accessioned	2022-03-30T04:09:35Z
dc.date.available	2022-03-30T04:09:35Z
dc.date.issued	2021-02	en_US
dc.identifier.citation	Journal of Groups, complexity, cryptology, 12(2).	en_US
dc.identifier.issn	1869-6104	en_US
dc.identifier.uri	https://doi.org/10.46298/jgcc.2020.12.2.6649	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/6642
dc.description.abstract	The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem. In this paper, we will argue that initial minors are a viable way to solve this problem. This paper will present necessary algorithms for this attack. We have written a code to verify the conjecture of initial minors using Schur complements. We were able to solve the problem for groups of order up to 250.	en_US
dc.language.iso	en	en_US
dc.publisher	EPI Sciences	en_US
dc.subject	Computer Science	en_US
dc.subject	Cryptography and Security,Mathematics	en_US
dc.subject	Algebraic Geometry	en_US
dc.subject	Mathematics	en_US
dc.subject	Number Theory	en_US
dc.subject	2021	en_US
dc.title	A new method for solving the elliptic curve discrete logarithm problem	en_US
dc.type	Article	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.sourcetitle	Journal of Groups, complexity, cryptology	en_US
dc.publication.originofpublisher	Foreign	en_US