Efficient Scalar Multiplications on Elliptic Curves with Direct Computations of Several Doublings : Special Section on Cryptography and Information Security

スポンサーリンク

概要

• 論文の詳細を見る

• We introduce efficient algorithms for scalar multiplication on elliptic curves defined over IF_p. The algorithms compute 2^kP directly from P, where P is a random point on an elliptic curve, without computing the intermediate points, which is faster than k repeated doublings. Moreover, we apply the algoruthms to scalar multiplication on elliptic curves, and analyze their computational complexity. As a result of their implementation with respect to affine (resp. weighted projective) coordinates, we achieved an increased performance factor of 1.45 (45%)(resp.1.15(15%)) in the scalar multiplication of the elliptic curve of size 160-bit.

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

著者

• SAKURAI Kouichi

  The author is with the Faculty of Kyusyu University

• Sakai Yasuyuki

  The Author Is With Information Technology R&d Center Mitsubishi Electric Corporation

• Sakurai Kouichi

  The Author Is With The Faculty Of Engineering Kyushu University

関連論文

• On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation(Special Section on Discrete Mathematics and Its Applications)
• Efficient Scalar Multiplications on Elliptic Curves with Direct Computations of Several Doublings : Special Section on Cryptography and Information Security
• Speeding Up Elliptic Scalar Multiplication Using Multidoubling(Special Section on Discrete Mathematics and Its Applications)
• A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications (Special lssue on Selected Papers from LA Synposium)

スポンサーリンク