On the power of multidoubling in speeding up elliptic scalar multiplication

Yasuyuki Sakai, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

We discuss multidoubling methods for efficient elliptic scalar multiplication. The methods allows computation of 2kP directly from P without computing the intermediate points, where P denotes a randomly selected point on an elliptic curve. We introduce algorithms for elliptic curves with Montgomery form and Weierstrass form defined over finite fields with characteristic greater than 3 in terms of affine coordinates. These algorithms are faster than k repeated doublings. Moreover, we apply the algorithms to scalar multiplication on elliptic curves and analyze computational complexity. As a result of our implementation with respect to the Montgomery and Weierstrass forms in terms of affine coordinates, we achieved running time reduced by 28% and 31%, respectively, in the scalar multiplication of an elliptic curve of size 160-bit over finite fields with characteristic greater than 3.

本文言語英語
ホスト出版物のタイトルSelected Areas in Cryptography - 8th Annual International Workshop, SAC 2001, Revised Papers
編集者Serge Vaudenay, Amr M. Youssef
出版社Springer Verlag
ページ268-283
ページ数16
ISBN(印刷版)9783540430667
DOI
出版ステータス出版済み - 2001
イベント8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001 - Toronto, カナダ
継続期間: 8 16 20018 17 2001

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2259
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他8th Annual International Workshop on Selected Areas in Cryptography, SAC 2001
国/地域カナダ
CityToronto
Period8/16/018/17/01

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On the power of multidoubling in speeding up elliptic scalar multiplication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル