Cover attacks for elliptic curves with prime order
arXiv:2012.07173 · doi:10.1007/s00145-023-09474-2
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 .
19 pages