Ultimately customized multiplication algorithm in the extension field for Xate and R-ate Pairing with Freeman curve

Kenta Nekado, Yasuyuki Nogami, Yoshitaka Morikawa

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

Abstract

Recently, pairing-based cryptographies such as ID-based cryptography and group signature have been studied. For their implementations, pairings such as Xate pairing and R-ate pairing are efficient. In order to make pairing calculations faster, it is important to make not only pairing algorithms but also arithmetic operations in the definition field efficient. Thus, in several kinds of ordinary pairing-friendly curves, this paper focuses on Freeman curve that enables fast pairing-based cryptographies. This paper proposes ultimately an customized multiplication algorithm in the extension field for Freeman curve, and then shows some implementation results of Xate pairing and R-ate pairing with Freeman curve.

Original languageEnglish
Title of host publicationTENCON 2010 - 2010 IEEE Region 10 Conference
Pages773-778
Number of pages6
DOIs
Publication statusPublished - Dec 1 2010
Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka, Japan
Duration: Nov 21 2010Nov 24 2010

Publication series

NameIEEE Region 10 Annual International Conference, Proceedings/TENCON

Other

Other2010 IEEE Region 10 Conference, TENCON 2010
CountryJapan
CityFukuoka
Period11/21/1011/24/10

    Fingerprint

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Nekado, K., Nogami, Y., & Morikawa, Y. (2010). Ultimately customized multiplication algorithm in the extension field for Xate and R-ate Pairing with Freeman curve. In TENCON 2010 - 2010 IEEE Region 10 Conference (pp. 773-778). [5686591] (IEEE Region 10 Annual International Conference, Proceedings/TENCON). https://doi.org/10.1109/TENCON.2010.5686591