On the discrete logarithm problem in elliptic curves
Top Cited Papers
Open Access
- 15 October 2010
- journal article
- Published by Wiley in Compositio Mathematica
- Vol. 147 (1), 75-104
- https://doi.org/10.1112/s0010437x10005075
Abstract
We study the elliptic curve discrete logarithm problem over finite extension fields. We show that for any sequences of prime powers (qi)i∈ℕand natural numbers (ni)i∈ℕwithni⟶∞andni/log (qi)⟶0 fori⟶∞, the elliptic curve discrete logarithm problem restricted to curves over the fields 𝔽qniican be solved in subexponential expected time (qnii)o(1). We also show that there exists a sequence of prime powers (qi)i∈ℕsuch that the problem restricted to curves over 𝔽qican be solved in an expected time ofeKeywords
This publication has 17 references indexed in Scilit:
- On the discrete logarithm problem in class groups of curvesMathematics of Computation, 2010
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problemJournal of Symbolic Computation, 2009
- The Weil Pairing, and Its Efficient CalculationJournal of Cryptology, 2004
- Solving Degenerate Sparse Polynomial Systems FasterJournal of Symbolic Computation, 1999
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Discriminants, resultants and multidimensional determinants, by I. M. Gelfand, M. M. Kapranov and A. Zelevinsky. Pp. 523. £60. 1994. ISBN 3-7643-3660-9 (Birkhäuser)The Mathematical Gazette, 1995
- A rigorous time bound for factoring integersJournal of the American Mathematical Society, 1992
- Generalised characteristic polynomialsJournal of Symbolic Computation, 1990
- Idempotent relations and factors of JacobiansMathematische Annalen, 1989
- The Arithmetic of Elliptic CurvesGraduate Texts in Mathematics, 1986