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.)
CITATION STYLE
Harasawa, R., Shikata, J., Suzuki, J., & Imai, H. (1999). Comparing the MOV and FR reductions in elliptic curve cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1592, pp. 190–205). Springer Verlag. https://doi.org/10.1007/3-540-48910-X_14
Mendeley helps you to discover research relevant for your work.