Efficient algorithm for Tate pairing of composite order

Yutaro Kiyomura, Tsuyoshi Takagi

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

1 被引用数 (Scopus)

抄録

A lot of important cryptographic schemes such as fully secure leakage-resilient encryption and keyword searchable encryption are based on pairings of composite order. Miller's algorithm is used to compute pairings, and the time taken to compute the pairings depends on the cost of calculating the Miller loop. As a way of speeding up calculations of the parings of prime order, the number of iterations of the Miller loop can be reduced by choosing a prime order of low hamming weight. However, it is difficult to choose a particular composite order that can speed up the pairings of composite order. Kobayashi et al. proposed an efficient algorithm for computing Miller's algorithm by using a window method, called Window Miller's algorithm. We can compute scalar multiplication of points on elliptic curves by using a window hybrid binary-ternary form (w-HBTF). In this paper, we propose a Miller's algorithm that uses w-HBTF to compute Tate pairing efficiently. This algorithm needs a precomputation of the points on an elliptic curve and rational functions. The proposed algorithm was implemented in Java on a PC and compared with Window Miller's Algorithm in terms of the time and memory needed to make their precomputed tables. We used the supersingular elliptic curve y2 = x3 + x of embedding degree 2 and a composite order of size of 2048 bits. The proposed algorithm with w = 6 = 2·3 was about 12% faster than Window Miller's Algorithm with w = 2 given smallest precomputed tables of the same memory size. Moreover, the proposed algorithm with w = 162 = 2·34 was about 8.5% faster than Window Miller's algorithm with w = 7 on each fastest algorithm.

本文言語英語
ホスト出版物のタイトルAdvances in Information and Computer Security - 8th International Workshop on Security, IWSEC 2013, Proceedings
ページ201-216
ページ数16
DOI
出版ステータス出版済み - 2013
イベント8th International Workshop on Security, IWSEC 2013 - Okinawa, 日本
継続期間: 11 18 201311 20 2013

出版物シリーズ

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

その他

その他8th International Workshop on Security, IWSEC 2013
国/地域日本
CityOkinawa
Period11/18/1311/20/13

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Efficient algorithm for Tate pairing of composite order」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル