Sciweavers

Share
ANTS
2000
Springer

Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem

12 years 18 days ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on the elliptic curve discrete logarithm problem (ECDLP) Miller 6] also gave heuristic reasoning as to why the index calculus idea may not extend to solve the analogous problem on elliptic curves. A careful analysis by Silverman and Suzuki provides strong theoretical and numerical evidence in support of Miller's arguments. An alternative approach recently proposed by Silverman, dubbed `xedni calculus', for attacking the ECDLP was also shown unlikely to work asymptotically by Silverman himself and others in a subsequent analysis. The results in this paper strengthen the observations of Miller, Silverman and others by deriving necessary but di cult-to-satisfy conditions for index-calculus type of methods to solve the ECDLP in subexponential time. Our analysis highlights the fundamental obstruction as be...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where ANTS
Authors Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
Comments (0)
books