Efficient Implementation of Tate Pairing on a Mobile Phone Using Java

Authors:
Yuto Kawahara;Tsuyoshi Takagi;Eiji Okamoto
Affiliations:
Future University-Hakodate, Japan;Future University-Hakodate, Japan;University of Tsukuba, Japan
Venue:
Computational Intelligence and Security
Year:
2007

Citing 10
Cited 1

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Radix-r Non-Adjacent Form and Its Application to Pairing-Based Cryptosystem*The preliminary version of this paper was presented at the 7th Information Security Conference (ISC 2004), held in Palo Alto.

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
Efficient GF(pm) arithmetic architectures for cryptographic applications

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Implementing cryptographic pairings on smartcards

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Collusion resistant broadcast encryption with short ciphertexts and private keys

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Efficient hardware for the tate pairing calculation in characteristic three

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Java implementation for pairing-based cryptosystems

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

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