Efficient implementation of tate pairing on a mobile phone using Java

Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto

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

5 Citations (Scopus)

Abstract

Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosystems. We present an efficient implementation for computing Tate pairing on a mobile phone using Java. We implemented the ηT pairing (a recent efficient variation of Duursma-Lee algorithm) over some finite fields of characteristic 3 with extension degree m = {97, 167, 193, 239}. Our optimized implementation for m = 97 achieved about 0.5 seconds for computing Tate pairing over FOMA SH90liS, NTTDoCoMo. Then our implementation of Tate pairing is compared in the same platform with other Java program of the standard cryptosystems, i.e., RSA cryptosystem and elliptic curve cryptosystem (ECC). The computation speed of Tate pairing is comparable to that of RSA or ECC on the same mobile device.

Original languageEnglish
Title of host publication2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
PublisherIEEE Computer Society
Pages1247-1252
Number of pages6
ISBN (Print)1424406056, 9781424406050
DOIs
Publication statusPublished - Jan 1 2006
Event2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 - Guangzhou, China
Duration: Oct 3 2006Oct 6 2006

Publication series

Name2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
Volume2

Other

Other2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
CountryChina
CityGuangzhou
Period10/3/0610/6/06

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Efficient implementation of tate pairing on a mobile phone using Java'. Together they form a unique fingerprint.

Cite this