A Remark on the MOV Algorithm for Non-supersingular Elliptic Curves (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• In recent years, the study of the security of Elliptic Curve Cryptosystems (ECCs) have been received much attention. The MOV algorithm, which reduces the elliptic curve discrete log problem (ECDLP) to the discrete log problem in finite fields with the Weil pairing, is a representative attack on ECCs. Recently Kanayama et al. observed a realization of the MOV algorithm for non-supersingular elliptic curves under the weakest condition. Shikata et al. independently considered a realization of the MOV algorithm for non-supersingular elliptic curves and proposed a generalization of the MOV algorithm. This short note explicitly shows that, under a usual cryptographical condition, we can apply the MOV algorithm to non-supersingular elliptic curves by using the multiplication by constant maps as in the case of supersingular. Namely, it is explicitly showed that we don't need such a generalization in order to realize the MOV algorithm for non-supersingular elliptic curves under a usual cryptographical condition.

• 社団法人電子情報通信学会の論文
• 2001-05-01

著者

• Saito Taiichi

  Telecommunications Advancement Organization Of Japan

• UCHIYAMA Shigenori

  NTT Laboratories

関連論文

• The Efficient Reductions between the Decision Diffie-Hellman Problem and Related Problems (Special Section on Discrete Mathematics and Its Applications)
• Remarks on Elliptic Curve Discrete Logarithm Problems(Special Section on Cryptography and Information Security)
• A Remark on the MOV Algorithm for Non-supersingular Elliptic Curves (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク