Efficient elliptic curve exponentiation(I)

スポンサーリンク

概要

• 論文の詳細を見る

• Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over F_<2^r> and E over F_p. However, there has not been reported fast implementation over E/F_p. Some current systems based on ElGamal or RSA may often use modulo arithmetic over F_p. Therefore it is convenient to construct fast elliptic curve cryptosystems over F_p. In this paper, we investigate how to implement elliptic curve cryptosystems on E/F_p. We also present the running time of elliptic curve cryptosystems based on E/F_p.

• 社団法人電子情報通信学会の論文
• 1997-07-18

著者

• Miyaji A

  School Of Information Science Japan Advanced Institute Of Science And Technology

• Miyaji Atsuko

  Multimedia Development Center Matsushita Electric Industrial Co. Ltd.

• Ono Takatoshi

  Matsushita Information Systems Research Laboratory Nagoya Co., Ltd.

• Cohen Henri

  Universite Bordeaux

• Ono Takatoshi

  Matsushita Information Systems Research Laboratory Nagoya Co. Ltd.

関連論文

• On Anonymity Metrics for Practical Anonymous Communication Protocols
• On the security relation among elliptic curve signature schemes
• Efficient elliptic curve exponentiation(I)
• Provably Secure Multi-signature Scheme with Signers' Intentions

スポンサーリンク