A new method for solving the elliptic curve discrete logarithm problem

Autor:	Abdullah, Ansari, Mahalanobis, Ayan, Mallick, Vivek M.
Rok vydání:	2020
Předmět:	Computer Science - Cryptography and Security Mathematics - Algebraic Geometry Mathematics - Number Theory
Zdroj:	journal of Groups, complexity, cryptology, Volume 12, Issue 2 (February 16, 2021) gcc:6649
Druh dokumentu:	Working Paper
DOI:	10.46298/jgcc.2020.12.2.6649
Popis:	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 $2^{50}$. Comment: 13 pages; revised for publication
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2005.05039 Zobrazit plný text záznamu View this record from Arxiv