Minors solve the elliptic curve discrete logarithm problem

TL;DR

This paper investigates computational approaches to solving the elliptic curve discrete logarithm problem, aiming to develop potent attack methods that could impact cryptographic security.

Contribution

It introduces new computational methods inspired by earlier work on matrix minors, offering potential advances in solving this cryptographic challenge.

Findings

Developed methods suggest potential for effective attacks on the problem

Results indicate promising directions for future research in elliptic curve cryptography

Work builds on previous matrix-based approaches to enhance solution strategies

Abstract

The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in computational mathematics. Its solution is supposed to provide interesting research directions. In this paper, we explore ways to solve the elliptic curve discrete logarithm problem. Our results are mostly computational. However, it seems, the methods that we develop and directions that we pursue can provide a potent attack on this problem. This work follows our earlier work, where we tried to solve this problem by finding a zero minor in a matrix over the same finite field on which the elliptic curve is defined. This paper is self-contained.