English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Minors solve the elliptic curve discrete logarithm problem