Efficient Implementation of Tate Pairing on a Mobile Phone using Java

Yuto Kawahara; Tsuyoshi Takagi; Eiji Okamoto

Paper 2006/299

Efficient Implementation of Tate Pairing on a Mobile Phone using Java

Yuto Kawahara, Tsuyoshi Takagi, and Eiji Okamoto

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 SH901iS, NTT DoCoMo. 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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: Tate pairing Java mobile phone efficient implementation
Contact author(s): takagi @ fun ac jp
History: 2006-09-06: received
Short URL: https://ia.cr/2006/299
License: CC BY

BibTeX

@misc{cryptoeprint:2006/299,
      author = {Yuto Kawahara and Tsuyoshi Takagi and Eiji Okamoto},
      title = {Efficient Implementation of Tate Pairing on a Mobile Phone using Java},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/299},
      year = {2006},
      url = {https://eprint.iacr.org/2006/299}
}