Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies

Kenta Nekado, Tatsuya Yuasa, Yasuyuki Nogami, Yoshitaka Morikawa

研究成果

抄録

Many public-key cryptographers have recently focused on cryptographic schemes based on pairing, which is a bilinear map from two elliptic curve groups to a group in an extension field. In order to provide efficient pairings, several kinds of pairing-friendly curves have been proposed. Since most of the pairing-friendly curves are defined over a certain extension field, arithmetic operations in extension field should be carried out efficiently. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in 2-nd tower field available for various pairingfriendly curves.

本文言語English
ホスト出版物のタイトルProceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010
ページ569-574
ページ数6
DOI
出版ステータスPublished - 12月 28 2010
イベント13th International Conference on Network-Based Information Systems, NBiS 2010 - Gifu
継続期間: 9月 14 20109月 16 2010

出版物シリーズ

名前Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010

Other

Other13th International Conference on Network-Based Information Systems, NBiS 2010
国/地域Japan
CityGifu
Period9/14/109/16/10

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • 情報システム

フィンガープリント

「Efficient squaring algorithm in 2-nd tower field available for various pairing-based cryptographies」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル