Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing

Yumi Sakemi, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa

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

4 Citations (Scopus)

Abstract

In the case of Barreto-Naehrig pairing-friendly curves of embedding degree 12 of order r, recent efficient Ate pairings such as R-ate, optimal, and Xate pairings achieve Miller loop lengths of . On the other hand, the twisted Ate pairing requires loop iterations, and thus is usually slower than the recent efficient Ate pairings. This paper proposes an improved twisted Ate pairing using Frobenius maps and a small scalar multiplication. The proposal splits the Miller's algorithm calculation into several independent parts, for which multi-pairing techniques apply efficiently. The maximum number of loop iterations in Miller's algorithm for the proposed twisted Ate pairing is equal to the attained by the most efficient Ate pairings.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2009 - 12th International Conference, Revised Selected Papers
Pages47-64
Number of pages18
DOIs
Publication statusPublished - Jul 20 2010
Event12th International Conference on Information Security and Cryptology, ICISC 2009 - Seoul, Korea, Republic of
Duration: Dec 2 2009Dec 4 2009

Publication series

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

Other

Other12th International Conference on Information Security and Cryptology, ICISC 2009
CountryKorea, Republic of
CitySeoul
Period12/2/0912/4/09

Keywords

  • Frobenius map
  • Miller's algorithm
  • multi-pairing
  • thread computing
  • twisted Ate pairing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing'. Together they form a unique fingerprint.

  • Cite this

    Sakemi, Y., Takeuchi, S., Nogami, Y., & Morikawa, Y. (2010). Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing. In Information Security and Cryptology - ICISC 2009 - 12th International Conference, Revised Selected Papers (pp. 47-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5984 LNCS). https://doi.org/10.1007/978-3-642-14423-3_4