Cover attacks for elliptic curves with prime order
Song Tian

TL;DR
This paper introduces a novel cover attack method for elliptic curve discrete logarithm problems over cubic extension fields, leveraging isogenies and Jacobian varieties to solve certain prime order cases more efficiently.
Contribution
It presents a new approach using $bF_q$-rational isogenies and Jacobian varieties to attack elliptic curves over cubic fields, which was not previously explored.
Findings
Can solve discrete log in some prime order elliptic curves over $bF_{q^3}$ in time $ ilde{O}(q)$
Introduces a transfer-based cover attack using isogenies and Jacobians
No covering maps used in the construction of the homomorphism
Abstract
We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields . It is based on a transfer: First an -rational -isogeny from the Weil restriction of the elliptic curve under consideration with respect to to the Jacobian variety of a genus three curve over is applied and then the problem is solved in the Jacobian via the index-calculus attacks. Although using no covering maps in the construction of the desired homomorphism, this method is, in a sense, a kind of cover attack. As a result, it is possible to solve the discrete logarithm problem in some elliptic curve groups of prime order over in a time of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Advanced Algebra and Geometry
