Some efficient algorithms for the final exponentiation of ηT pairing

Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

12 被引用数 (Scopus)

抄録

Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e.g., the Duursma-Lee algorithm and ηT pairing. In this paper we discuss how to enhance the speed of the final exponentiation of the ηT pairing in the extension field double struk F sign36n. Indeed, we propose some efficient algorithms using the torus T2(double struk F sign33n) that can efficiently compute an inversion and a powering by 3n + 1. Consequently, the total processing cost of computing the ηT pairing can be reduced by 16% for n = 97.

本文言語英語
ホスト出版物のタイトルInformation Security Practice and Experience - Third International Conference, ISPEC 2007, Proceedings
出版社Springer Verlag
ページ254-268
ページ数15
ISBN(印刷版)3540721592, 9783540721598
DOI
出版ステータス出版済み - 2007
外部発表はい
イベント3rd International Conference on Information Security Practice and Experience, ISPEC 2007 - Hong Kong, 香港
継続期間: 5月 7 20075月 9 2007

出版物シリーズ

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

その他

その他3rd International Conference on Information Security Practice and Experience, ISPEC 2007
国/地域香港
CityHong Kong
Period5/7/075/9/07

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータサイエンス一般

フィンガープリント

「Some efficient algorithms for the final exponentiation of ηT pairing」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル