Short memory scalar multiplication on Koblitz curves

Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaume

研究成果: Contribution to journalConference article査読

8 被引用数 (Scopus)

抄録

We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We propose two settings for our method. In the first setting, well-suited for hardware implementations, memory requirements are reduced by 85%. In the second setting, well-suited for software implementations, our technique reduces the memory consumption by 70%. Thus, with much smaller memory usage, the proposed method yields the same efficiency as the fastest scalar multiplication schemes on Koblitz curves.

本文言語英語
ページ(範囲)91-105
ページ数15
ジャーナルLecture Notes in Computer Science
3659
DOI
出版ステータス出版済み - 2005
イベント7th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2005 - Edinburgh, 英国
継続期間: 8 29 20059 1 2005

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Short memory scalar multiplication on Koblitz curves」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル