Abstract
This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so that it can be applied to some non-supersingular elliptic curves (ECs); decrypt Frey and Rück (FR)’s idea to describe the detail of the FR reduction and to implement it for actual elliptic curves with finite fields on a practical scale; and based on them compare the (extended) MOV and FR reductions from an algorithmic point of view. (This paper has primarily an expository role.)
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Adleman, J. DeMarrais, and M. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory, Lecture Notes in Computer Science, volume 877, Springer-Verlag, 1994, pp. 28–40.
A. O. Atkin, The number of points on an elliptic curve modulo a prime, preprint, 1988.
A. Atkin and F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61 (1993), 29–68.
E. Bach, Algorithmic Number Theory, Volume I; Efficient Algorithms, MIT Press, Cambridge, Massachusetts, 1996.
R. Balasubramanian and N. Koblitz, The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm, Journal of Cryptography 11 (1998), 141–145.
N. Elkies, Explicit isogenies, preprint, 1991.
G. Frey and H. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Mathematics of Computation 62 (1994), 865–874.
M. Kac, On the notion of recurrence in discrete stochastic processes, Ann. of Math. Statist., 53 (1947), 1002–1010.
N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation 48 (1987), 203–209.
N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 2nd edition, 1996.
H. W. Lenstra, Factoring integers with elliptic curves. Annals of Mathematics, 126 (1987), 649–673.
R. Lercier and F. Morain, Counting the number of points on elliptic curves over finite fields: strategy and performance, Advances in Cryptology, EUROCRYPT’95, Lecture Notes in Computer Science 921 (1995), 79–94.
A. Menezes, T. Okamoto, and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory 39 (1993), 1639–1646.
A. Menezes, Elliptic curve public key cryptosystems, Kluwer Academic Publishes (1994).
V. S. Miller, Use of elliptic curves in cryptography, Advances in Cryptography CRYPTO’ 85 (Lecture Notes in Computer Science, vol 218), Springer-Verlag, 1986, pp. 417–426.
V. Miller, Short program for functions on curves, unpublished manuscript, 1986.
S.C. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, 24 (1978),pp 106–110.
T. Satoh and K. Araki, Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, Commentarii Math, Univ, Saniti Pauli, 47,1,pp 88–92 (1998).
R. Schoof, Nonsingular plane cubic curves over finite fields, Journal of Combination Theory, Vol. A. 46 (1987), 183–211.
R. Schoof, Elliptic curves over finite fields and the computation of square roots modulo p Math. Comp. 44 (1985), 483–494.
I. Semaev, Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p, Mathematics of Computation 67 (1998), 353–356.
J. H. Silverman, The Arithmetic of Elliptic Curves, Graduate Texts in Math., vol. 106, Springer-Verlag, Berlin and New York, 1994.
J. H. Silverman, J. Suzuki, Elliptic curve discrete logarithms and index calculus, ASIACRYPT’98 (Lecture Notes in Computer Science), to appear.
N. Smart, The discrete logarithm problem on elliptic curves of trace one, preprint, 1997.d
J. Tate, WC-groups over p-adic fields, ann Sci. Ecole, Norm. Sup. 2 (1969), 521–560
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harasawa, R., Shikata, J., Suzuki, J., Imai, H. (1999). Comparing the MOV and FR Reductions in Elliptic Curve Cryptography. In: Stern, J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48910-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65889-4
Online ISBN: 978-3-540-48910-8
eBook Packages: Springer Book Archive