Efficient Implementation of Tate Pairing on a Mobile Phone Using Java

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 the T pairing over FOMA SH901iS, NTT DoCoMo. Then our implementation of the T 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 the T pairing is comparable to that of RSA or ECC on the same mobile device.

• Type: Conference
• Year: 2006
• Where: CIS
• Authors: Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto
• Keywords: Applied Computing, CIS 2006, Pairing, Pairing-based Cryptosystems, Public Key Cryptosystems