Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cover attacks for elliptic curves with prime order (2012.07173v1)

Published 13 Dec 2020 in cs.CR and math.AG

Abstract: We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields $\mathbb{F}{q3}$. It is based on a transfer: First an $\mathbb{F}_q$-rational $(\ell,\ell,\ell)$-isogeny from the Weil restriction of the elliptic curve under consideration with respect to $\mathbb{F}{q3}/\mathbb{F}_q$ to the Jacobian variety of a genus three curve over $\mathbb{F}q$ 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 $\mathbb{F}{q3}$ in a time of $\tilde{O}(q)$.

Citations (1)

Summary

We haven't generated a summary for this paper yet.