Cryptology ePrint Archive: Report 2006/299

Efficient Implementation of Tate Pairing on a Mobile Phone using Java

Yuto Kawahara and 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 $\eta_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.

Category / Keywords: implementation / Tate pairing, Java, mobile phone, efficient implementation

Date: received 31 Aug 2006

Contact author: takagi at fun ac jp

Available format(s): PDF | BibTeX Citation

Version: 20060906:191354 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]