A hardware-oriented algorithm for computing in Jacobians and its implementation for hyperelliptic curve cryptosystems

Tetsuya Tamura, Kouichi Sakurai, Tsutomu Matsumoto

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

抄録

In this paper, we present algorithms, suitable for hardware implementation, for computation in the Jacobian of a hyperelliptic curve defined over GF(2n). We take curves of genus 3 and 6, designed by using 0.27- um CMOS gate array technology, and estimate the number of multiplication operations and the size and speed of hardware based on the proposed algorithm. It is shown that hardware for genus 6 curves computes an addition (resp. doubling) operation in 100 (resp. 29) clock cycles and can work at clock frequencies of up to 83 MHz We also compare a hyperelliptic curve cryptosystem with RSA and elliptic curve cryptosystems from the viewpoint of hardware implementation.

本文言語英語
ホスト出版物のタイトルInformation Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings
編集者JooSeok Song
出版社Springer Verlag
ページ221-235
ページ数15
ISBN(印刷版)3540673806, 9783540673804
DOI
出版ステータス出版済み - 1 1 2000
イベント2nd International Conference on Information Security and Cryptology, ICISC 1999 - Seoul, 大韓民国
継続期間: 12 9 199912 10 1999

出版物シリーズ

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

その他

その他2nd International Conference on Information Security and Cryptology, ICISC 1999
国/地域大韓民国
CitySeoul
Period12/9/9912/10/99

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「A hardware-oriented algorithm for computing in Jacobians and its implementation for hyperelliptic curve cryptosystems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル