Abstract
Essentially all subexponential time algorithms for the discrete logarithm problem over finite fields 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 difficult-to-satisfy conditions for index-calculus type of methods to solve the ECDLP in subexponential time. Our analysis highlights the fundamental obstruction as being the necessity to lift an asymptotically increasing number of random points on an elliptic curve over a finite field to rational points of reasonably bounded height on an elliptic curve over ℚ. This difficulty is underscored by the fact that a method that meets the requirement implies, by virtue of a theorem we prove, a method for constructing elliptic curves over ℚ of arbitrarily large rank.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hindry, M., Silverman, J.: The canonical height and integral points on elliptic curves. Invent. Math. 93, 419–450 (1988)
Jacobson, M.J., Koblitz, N., Silverman, J.H., Stein, A., Teske, E.: Analysis of the Xedni Calculus Attack, Preprint
Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48, 203–209 (1987)
Lang, S.: Fundamental of Diophantine Geometry. Springer, Heidelberg (1983)
Mazur, B.: Modular curves and Eisenstein ideal. I.H.E.S. Publ. Math. 47, 33–186 (1977)
Miller, V.: The use of elliptic curves in cryptography. In: Advances in Cryptography, pp. 417–426. Springer, Heidelberg (1986)
Silverman, J.H.: The Arithmetic of Elliptic Curves. Springer, Heidelberg (1986)
Silverman, J.H.: The xedni calculus and the elliptic curve discrete logarithm prob- lem, preprint
Silverman, J.H.: Lower bound for the canonical height on elliptic curves. Duke Math. J. 48, 633–648 (1981)
Silverman, J.H., Suzuki, J.: Elliptic curve discrete logarithms and the index calculus. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 110–125. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, MD.A., Kueh, K.L., Tan, KS. (2000). Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem. In: Bosma, W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722028_22
Download citation
DOI: https://doi.org/10.1007/10722028_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67695-9
Online ISBN: 978-3-540-44994-2
eBook Packages: Springer Book Archive