Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem

スポンサーリンク

概要

• 論文の詳細を見る

• In 1990, Menezes, Okamoto and Vanstone proposed a method that reduces EDLP to DLP, which gave an impact on the security of cryptosystems based on EDLP. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid.

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

著者

• MIYAJI Atsuko

  Matsushita Electric Industrial Co., LTD.

• Miyaji Atsuko

  Matsushita Electric Industrial Co. Ltd.

関連論文

• Another Countermeasure to Forgeries over Message Recovery Signature
• Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem
• Elliptic Curves Suitable for Cryptosystems
• On Secure and Fast Elliptic Curve Cryptosystems over F_p

スポンサーリンク