Sciweavers

EUROCRYPT
1999
Springer

Comparing the MOV and FR Reductions in Elliptic Curve Cryptography

14 years 3 months ago
Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
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¨uck (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.)
Ryuichi Harasawa, Junji Shikata, Joe Suzuki, Hidek
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where EUROCRYPT
Authors Ryuichi Harasawa, Junji Shikata, Joe Suzuki, Hideki Imai
Comments (0)