Universal ηT pairing algorithm over arbitrary extension degree

Masaaki Shirase, Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto

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

6 被引用数 (Scopus)

抄録

The ηT pairing on supersingular is one of the most efficient algorithms for computing the bilinear pairing [3]. The rfr pairing defined over finite field F3n has embedding degree 6, so that it is particularly efficient for higher security with large extension degree n. Note that the explicit algorithm over F3n in [3] is designed just for n Ξ 1 (mod 12), and it is relatively complicated to construct an explicit algorithm for n ≢ 1 (mod 12). It is better that we can select many n's to implement the r¡T pairing, since n corresponds to security level of the ηT pairing. In this paper we construct an explicit algorithm for computing the ηT pairing with arbitrary extension degree n. However, the algorithm should contain many branch conditions depending on n and the curve parameters, that is undesirable for implementers of the ηT pairing. This paper then proposes the universal ηT pairing (ηT pairing), which satisfies the bilinearity of pairing (compatible with Tate pairing) without any branches in the program, and is as efficient as the original one. Therefore the proposed universal ηT pairing is suitable for the implementation of various extension degrees n with higher security.

本文言語英語
ホスト出版物のタイトルInformation Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers
出版社Springer Verlag
ページ1-15
ページ数15
ISBN(印刷版)354077534X, 9783540775348
DOI
出版ステータス出版済み - 2007
イベント8th International Workshop on Information Security Applications, WISA 2007 - Jeju Island, 大韓民国
継続期間: 8 27 20078 29 2007

出版物シリーズ

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

その他

その他8th International Workshop on Information Security Applications, WISA 2007
国/地域大韓民国
CityJeju Island
Period8/27/078/29/07

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Universal ηT pairing algorithm over arbitrary extension degree」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル