| 講演名 | 2007-03-15 Universal η_T Pairing Algorithm over Arbitrary Extension Degree , |
|---|---|
| PDFダウンロードページ |  PDFダウンロードページへ |
| 抄録(和) | |
| 抄録(英) | The η_T pairing on supersingular is one of the most efficient algorithms for computing the bilinear pairing [2]. The η_T pairing defined over finite field F_<3n> has embedding degree 6, so that it is particularly efficient for higher security with large extension degree n. Note that the extension degree n cannot be freely selected due to several attacks, for examples, we can securely use only n=97, 163, 167, 193,239,313,353,.... It is better that we can select many n's to implement the η_T pairing, since n corresponds to security level of the η_T pairing. However, the explicit algorithm over F_<3n> in [2] is designed just for n≡1 (mod 12). It is relative complicated to construct an explicit algorithm for n≢1 (mod 12). because it causes several variations based on extension degree n and the curve parameters. In this paper we present an explicit algorithm for computing η_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. |
| キーワード(和) | |
| キーワード(英) | η_T pairing / Duursma-Lee algorithm / extension degree |
| 資料番号 | IT2006-76,ISEC2006-131,WBS2006-73 |
| 発行日 |
| 研究会情報 | |
| 研究会 | ISEC |
|---|---|
| 開催期間 | 2007/3/8(から1日開催) |
| 開催地（和） | |
| 開催地（英） | |
| テーマ（和） | |
| テーマ（英） | |
| 委員長氏名（和） | |
| 委員長氏名（英） | |
| 副委員長氏名（和） | |
| 副委員長氏名（英） | |
| 幹事氏名（和） | |
| 幹事氏名（英） | |
| 幹事補佐氏名（和） | |
| 幹事補佐氏名（英） | |
| 講演論文情報詳細 | |
| 申込み研究会 | Information Security (ISEC) |
|---|---|
| 本文の言語 | ENG |
| タイトル（和） | |
| サブタイトル（和） | |
| タイトル（英） | Universal η_T Pairing Algorithm over Arbitrary Extension Degree |
| サブタイトル（和） | |
| キーワード(1)（和/英） | / η_T pairing |
| 第 1 著者 氏名（和/英） | / Masaaki SHIRASE |
| 第 1 著者 所属（和/英） | School of Systems Information Science, Future University-Hakodate |
| 発表年月日 | 2007-03-15 |
| 資料番号 | IT2006-76,ISEC2006-131,WBS2006-73 |
| 巻番号（vol） | vol.106 |
| 号番号（no） | 596 |
| ページ範囲 | pp.- |
| ページ数 | 6 |
| 発行日 | |