Some efficient algorithms for the final exponentiation of ηT pairing

Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto

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

10 Citations (Scopus)

Abstract

Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e.g., the Duursma-Lee algorithm and ηT pairing. In this paper we discuss how to enhance the speed of the final exponentiation of the ηT pairing in the extension field double struk F sign36n. Indeed, we propose some efficient algorithms using the torus T2(double struk F sign33n) that can efficiently compute an inversion and a powering by 3n + 1. Consequently, the total processing cost of computing the ηT pairing can be reduced by 16% for n = 97.

Original languageEnglish
Title of host publicationInformation Security Practice and Experience - Third International Conference, ISPEC 2007, Proceedings
PublisherSpringer Verlag
Pages254-268
Number of pages15
ISBN (Print)3540721592, 9783540721598
DOIs
Publication statusPublished - Jan 1 2007
Event3rd International Conference on Information Security Practice and Experience, ISPEC 2007 - Hong Kong, Hong Kong
Duration: May 7 2007May 9 2007

Publication series

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

Other

Other3rd International Conference on Information Security Practice and Experience, ISPEC 2007
CountryHong Kong
CityHong Kong
Period5/7/075/9/07

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Some efficient algorithms for the final exponentiation of η<sub>T</sub> pairing'. Together they form a unique fingerprint.

  • Cite this

    Shirase, M., Takagi, T., & Okamoto, E. (2007). Some efficient algorithms for the final exponentiation of ηT pairing. In Information Security Practice and Experience - Third International Conference, ISPEC 2007, Proceedings (pp. 254-268). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4464 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-72163-5_20