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 |
| Pages | 1247-1252 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - Dec 1 2007 |
| 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
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. 2007. 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
}
TY - GEN
T1 - Efficient implementation of tate pairing on a mobile phone using Java
AU - Kawahara, Yuto
AU - Takagi, Tsuyoshi
AU - Okamoto, Eiji
PY - 2007/12/1
Y1 - 2007/12/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
AN - SCOPUS:38949204473
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
ER -