Cover attacks for elliptic curves with prime order
Cryptography and Security
2023-08-16 v1 Algebraic Geometry
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 .
Cite
@article{arxiv.2012.07173,
title = {Cover attacks for elliptic curves with prime order},
author = {Song Tian},
journal= {arXiv preprint arXiv:2012.07173},
year = {2023}
}
Comments
19 pages