Efficient algorithm for Tate pairing of composite order

Yutaro Kiyomura, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - 8th International Workshop on Security, IWSEC 2013, Proceedings
Pages201-216
Number of pages16
DOIs
Publication statusPublished - Dec 1 2013
Event8th International Workshop on Security, IWSEC 2013 - Okinawa, Japan
Duration: Nov 18 2013Nov 20 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8231 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Workshop on Security, IWSEC 2013
CountryJapan
CityOkinawa
Period11/18/1311/20/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient algorithm for Tate pairing of composite order'. Together they form a unique fingerprint.

  • Cite this

    Kiyomura, Y., & Takagi, T. (2013). Efficient algorithm for Tate pairing of composite order. In Advances in Information and Computer Security - 8th International Workshop on Security, IWSEC 2013, Proceedings (pp. 201-216). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8231 LNCS). https://doi.org/10.1007/978-3-642-41383-4_13