Integer variable x-based ate pairing

Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, Hidehiro Kato, Yoshitaka Morikawa

研究成果

60 被引用数 (Scopus)

抄録

In implementing an efficient pairing calculation, it is said that the lower bound of the number of iterations of Miller's algorithm is log2 r/Φ(k), where Φ(•) is the Euler's function. Ate pairing reduced the number of the loops of Miller's algorithm of Tate pairing from [log 2r] to[log2(t - 1)]. Recently, it is known to systematically prepare a pairing-friendly elliptic curve whose parameters are given by a polynomial of integer variable "χ". For the curve, this paper gives integer variable χ -based Ate pairing that achieves the lower bound by reducing it to [log2X].

本文言語English
ホスト出版物のタイトルPairing-Based Cryptography - Pairing 2008 - Second International Conference, Proceedings
ページ178-191
ページ数14
DOI
出版ステータスPublished - 2008
イベント2nd International Conference on Pairing-Based Cryptography, Pairing 2008 - Egham
継続期間: 9月 1 20089月 3 2008

出版物シリーズ

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

Other

Other2nd International Conference on Pairing-Based Cryptography, Pairing 2008
国/地域United Kingdom
CityEgham
Period9/1/089/3/08

ASJC Scopus subject areas

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

フィンガープリント

「Integer variable x-based ate pairing」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル