Efficient implementation of the pairing on mobilephones using BREW

Motoi Yoshitomi, Tsuyoshi Takagi, Shinsaku Kiyomoto, Toshiaki Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Pairing based cryptography can accomplish novel security applications such as ID-based cryptosystems, which have not been constructed efficiently without the pairing. The processing speed of the pairing based cryptography is relatively slow compared with the other conventional public key cryptography. However, several efficient algorithms for computing the pairing have been proposed, namely Duursmar-Lee algorithm and its variant ηT pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones, and examine the feasibility of the pairing based cryptosystems on ubiquitous devices. Indeed the processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over F397. It has become fast enough for implementing security applications using the pairing on mobilephones.

Original languageEnglish
Title of host publicationInformation Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers
Pages208-214
Number of pages7
Publication statusPublished - Dec 1 2007
Event8th International Workshop on Information Security Applications, WISA 2007 - Jeju Island, Korea, Republic of
Duration: Aug 27 2007Aug 29 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4867 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Workshop on Information Security Applications, WISA 2007
CountryKorea, Republic of
CityJeju Island
Period8/27/078/29/07

Fingerprint

Mobile Phone
Efficient Implementation
Pairing
Cryptography
Pairing-based Cryptography
Public key cryptography
Pairing-based Cryptosystems
Processing
Public Key Cryptography
Identity-based
Cryptosystem
Efficient Algorithms
Curve
Computing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yoshitomi, M., Takagi, T., Kiyomoto, S., & Tanaka, T. (2007). Efficient implementation of the pairing on mobilephones using BREW. In Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers (pp. 208-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4867 LNCS).

Efficient implementation of the pairing on mobilephones using BREW. / Yoshitomi, Motoi; Takagi, Tsuyoshi; Kiyomoto, Shinsaku; Tanaka, Toshiaki.

Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers. 2007. p. 208-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4867 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yoshitomi, M, Takagi, T, Kiyomoto, S & Tanaka, T 2007, Efficient implementation of the pairing on mobilephones using BREW. in Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4867 LNCS, pp. 208-214, 8th International Workshop on Information Security Applications, WISA 2007, Jeju Island, Korea, Republic of, 8/27/07.
Yoshitomi M, Takagi T, Kiyomoto S, Tanaka T. Efficient implementation of the pairing on mobilephones using BREW. In Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers. 2007. p. 208-214. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yoshitomi, Motoi ; Takagi, Tsuyoshi ; Kiyomoto, Shinsaku ; Tanaka, Toshiaki. / Efficient implementation of the pairing on mobilephones using BREW. Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers. 2007. pp. 208-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{646649e0ee1c4e11ba78fbd0807d6e19,
title = "Efficient implementation of the pairing on mobilephones using BREW",
abstract = "Pairing based cryptography can accomplish novel security applications such as ID-based cryptosystems, which have not been constructed efficiently without the pairing. The processing speed of the pairing based cryptography is relatively slow compared with the other conventional public key cryptography. However, several efficient algorithms for computing the pairing have been proposed, namely Duursmar-Lee algorithm and its variant ηT pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones, and examine the feasibility of the pairing based cryptosystems on ubiquitous devices. Indeed the processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over F397. It has become fast enough for implementing security applications using the pairing on mobilephones.",
author = "Motoi Yoshitomi and Tsuyoshi Takagi and Shinsaku Kiyomoto and Toshiaki Tanaka",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "354077534X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "208--214",
booktitle = "Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers",

}

TY - GEN

T1 - Efficient implementation of the pairing on mobilephones using BREW

AU - Yoshitomi, Motoi

AU - Takagi, Tsuyoshi

AU - Kiyomoto, Shinsaku

AU - Tanaka, Toshiaki

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Pairing based cryptography can accomplish novel security applications such as ID-based cryptosystems, which have not been constructed efficiently without the pairing. The processing speed of the pairing based cryptography is relatively slow compared with the other conventional public key cryptography. However, several efficient algorithms for computing the pairing have been proposed, namely Duursmar-Lee algorithm and its variant ηT pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones, and examine the feasibility of the pairing based cryptosystems on ubiquitous devices. Indeed the processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over F397. It has become fast enough for implementing security applications using the pairing on mobilephones.

AB - Pairing based cryptography can accomplish novel security applications such as ID-based cryptosystems, which have not been constructed efficiently without the pairing. The processing speed of the pairing based cryptography is relatively slow compared with the other conventional public key cryptography. However, several efficient algorithms for computing the pairing have been proposed, namely Duursmar-Lee algorithm and its variant ηT pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones, and examine the feasibility of the pairing based cryptosystems on ubiquitous devices. Indeed the processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over F397. It has become fast enough for implementing security applications using the pairing on mobilephones.

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

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

M3 - Conference contribution

AN - SCOPUS:38549135553

SN - 354077534X

SN - 9783540775348

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

SP - 208

EP - 214

BT - Information Security Applications - 8th International Workshop, WISA 2007, Revised Selected Papers

ER -