Efficient implementation of tate pairing on a mobile phone using Java

Yuto Kawahara; Tsuyoshi Takagi; Eiji Okamoto

doi:10.1109/ICCIAS.2006.295256

Efficient implementation of tate pairing on a mobile phone using Java

Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto

Laboratory of Mathematical Design for Advanced Cryptography

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English
Title of host publication	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
Publisher	IEEE Computer Society
Pages	1247-1252
Number of pages	6
ISBN (Print)	1424406056, 9781424406050
DOIs	https://doi.org/10.1109/ICCIAS.2006.295256
Publication status	Published - Jan 1 2006
Event	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 - Guangzhou, China Duration: Oct 3 2006 → Oct 6 2006

Publication series

Name	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
Volume	2

Other

Other	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
Country	China
City	Guangzhou
Period	10/3/06 → 10/6/06

Fingerprint

All Science Journal Classification (ASJC) codes

Computer Science(all)
Control and Systems Engineering

Cite this

Kawahara, Y., Takagi, T., & Okamoto, E. (2006). Efficient implementation of tate pairing on a mobile phone using Java. In 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 (pp. 1247-1252). [4076162] (2006 International Conference on Computational Intelligence and Security, ICCIAS 2006; Vol. 2). IEEE Computer Society. https://doi.org/10.1109/ICCIAS.2006.295256

Efficient implementation of tate pairing on a mobile phone using Java. / Kawahara, Yuto; Takagi, Tsuyoshi; Okamoto, Eiji.

2006 International Conference on Computational Intelligence and Security, ICCIAS 2006. IEEE Computer Society, 2006. p. 1247-1252 4076162 (2006 International Conference on Computational Intelligence and Security, ICCIAS 2006; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kawahara, Y, Takagi, T & Okamoto, E 2006, Efficient implementation of tate pairing on a mobile phone using Java. in 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006., 4076162, 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006, vol. 2, IEEE Computer Society, pp. 1247-1252, 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006, Guangzhou, China, 10/3/06. https://doi.org/10.1109/ICCIAS.2006.295256

Kawahara Y, Takagi T, Okamoto E. Efficient implementation of tate pairing on a mobile phone using Java. In 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006. IEEE Computer Society. 2006. p. 1247-1252. 4076162. (2006 International Conference on Computational Intelligence and Security, ICCIAS 2006). https://doi.org/10.1109/ICCIAS.2006.295256

@inproceedings{19a44bc96c6643e3b57f313764e13e46,

title = "Efficient implementation of tate pairing on a mobile phone using Java",

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.",

author = "Yuto Kawahara and Tsuyoshi Takagi and Eiji Okamoto",

year = "2006",

month = "1",

day = "1",

doi = "10.1109/ICCIAS.2006.295256",

language = "English",

isbn = "1424406056",

series = "2006 International Conference on Computational Intelligence and Security, ICCIAS 2006",

publisher = "IEEE Computer Society",

pages = "1247--1252",

booktitle = "2006 International Conference on Computational Intelligence and Security, ICCIAS 2006",

address = "United States",

}

TY - GEN

T1 - Efficient implementation of tate pairing on a mobile phone using Java

AU - Kawahara, Yuto

AU - Takagi, Tsuyoshi

AU - Okamoto, Eiji

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38949204473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38949204473&partnerID=8YFLogxK

U2 - 10.1109/ICCIAS.2006.295256

DO - 10.1109/ICCIAS.2006.295256

M3 - Conference contribution

SN - 1424406056

SN - 9781424406050

T3 - 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

SP - 1247

EP - 1252

BT - 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

PB - IEEE Computer Society

ER -

Access to Document

10.1109/ICCIAS.2006.295256