Efficient implementation of tate pairing on a mobile phone using java

Yuto Kawahara; Tsuyoshi Takagi; Eiji Okamoto

doi:10.1007/978-3-540-74377-4_42

Efficient implementation of tate pairing on a mobile phone using java

Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto

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

12 Citations (Scopus)

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 the T]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 X\T pairing is comparable to that of RSA or ECC on the same mobile device.

Original language	English
Title of host publication	Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers
Publisher	Springer Verlag
Pages	396-405
Number of pages	10
ISBN (Print)	9783540743767
DOIs	https://doi.org/10.1007/978-3-540-74377-4_42
Publication status	Published - 2007
Externally published	Yes
Event	International Conference on Computational Intelligence and Security, CIS 2006 - Guangzhou, China Duration: Nov 3 2006 → Nov 6 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4456 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

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

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-74377-4_42

Cite this

Kawahara, Y., Takagi, T., & Okamoto, E. (2007). Efficient implementation of tate pairing on a mobile phone using java. In Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers (pp. 396-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4456 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_42

Efficient implementation of tate pairing on a mobile phone using java. / Kawahara, Yuto; Takagi, Tsuyoshi; Okamoto, Eiji.
Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers. Springer Verlag, 2007. p. 396-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4456 LNAI).

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

Kawahara, Y, Takagi, T & Okamoto, E 2007, Efficient implementation of tate pairing on a mobile phone using java. in Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4456 LNAI, Springer Verlag, pp. 396-405, International Conference on Computational Intelligence and Security, CIS 2006, Guangzhou, China, 11/3/06. https://doi.org/10.1007/978-3-540-74377-4_42

Kawahara Y, Takagi T, Okamoto E. Efficient implementation of tate pairing on a mobile phone using java. In Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers. Springer Verlag. 2007. p. 396-405. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74377-4_42

Kawahara, Yuto ; Takagi, Tsuyoshi ; Okamoto, Eiji. / Efficient implementation of tate pairing on a mobile phone using java. Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers. Springer Verlag, 2007. pp. 396-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7b9381200b974fa380c4b589d6344a4a,

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 the T]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 X\T pairing is comparable to that of RSA or ECC on the same mobile device.",

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

note = "Funding Information: ★ Partially funded by Fapesp and CNPq research grants.; International Conference on Computational Intelligence and Security, CIS 2006 ; Conference date: 03-11-2006 Through 06-11-2006",

year = "2007",

doi = "10.1007/978-3-540-74377-4_42",

language = "English",

isbn = "9783540743767",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "396--405",

booktitle = "Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers",

address = "Germany",

}

TY - GEN

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

AU - Kawahara, Yuto

AU - Takagi, Tsuyoshi

AU - Okamoto, Eiji

N1 - Funding Information: ★ Partially funded by Fapesp and CNPq research grants.

PY - 2007

Y1 - 2007

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 the T]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 X\T 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 the T]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 X\T pairing is comparable to that of RSA or ECC on the same mobile device.

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

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

U2 - 10.1007/978-3-540-74377-4_42

DO - 10.1007/978-3-540-74377-4_42

M3 - Conference contribution

AN - SCOPUS:38349027406

SN - 9783540743767

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 396

EP - 405

BT - Computational Intelligence and Security - International Conference, CIS 2006, Revised Selected Papers

PB - Springer Verlag

T2 - International Conference on Computational Intelligence and Security, CIS 2006

Y2 - 3 November 2006 through 6 November 2006

ER -

Efficient implementation of tate pairing on a mobile phone using java

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this