A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks

Katsuyuki Okeya, Kunihiko Miyazaki, Kouichi Sakurai

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

24 被引用数 (Scopus)

抄録

In this paper, we propose a scalar multiplication method that does not incur a higher computational cost for randomized projective coordinates of the Montgomery form of elliptic curves. A randomized projective coordinates method is a countermeasure against side channel attacks on an elliptic curve cryptosystem in which an attacker cannot predict the appearance of a specific value because the coordinates have been randomized. However, because of this randomization, we cannot assume the Z-coordinate to be 1. Thus, the computational cost increases by multiplications of Z-coordinates, 10%. Our results clarify the advantages of cryptographic usage of Montgomery-form elliptic curves in constrained environments such as mobile devices and smart cards.

本文言語英語
ホスト出版物のタイトルInformation Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings
編集者Kwangjo Kim
出版社Springer Verlag
ページ428-439
ページ数12
ISBN(印刷版)3540433198, 9783540433194
DOI
出版ステータス出版済み - 2002
イベント4th International Conference on Information Security and Cryptology, ICISC 2001 - Seoul, 大韓民国
継続期間: 12 6 200112 7 2001

出版物シリーズ

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

その他

その他4th International Conference on Information Security and Cryptology, ICISC 2001
Country大韓民国
CitySeoul
Period12/6/0112/7/01

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「A fast scalar multiplication method with randomized projective coordinates on a Montgomery-form elliptic curve secure against side channel attacks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル