### Efficient Implementation of the Pairing on Mobilephones using BREW

Motoi Yoshitomi, Tsuyoshi Takagi, Shinsaku Kiyomoto, and Toshiaki Tanaka

##### Abstract

Pairing based cryptosystems 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 cryptosystems is relatively slow compared with the other conventional public key cryptosystems. However, several efficient algorithms for computing the pairing have been proposed, namely Duursma-Lee algorithm and its variant $\eta_T$ pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones. The processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over $\mathbb F_{3^{97}}$. It has become efficient enough to implement security applications, such as ID-based cryptosystems and broadcast encryption, using the pairing on BREW mobilephones.

Available format(s)
Category
Implementation
Publication info
Published elsewhere. This is a full version of WISA 2007 paper.
Keywords
pairing based cryptosystemmobilephoneBREW
Contact author(s)
takagi @ fun ac jp
History
2007-09-13: last of 2 revisions
See all versions
Short URL
https://ia.cr/2007/340

CC BY

BibTeX

@misc{cryptoeprint:2007/340,
author = {Motoi Yoshitomi and Tsuyoshi Takagi and Shinsaku Kiyomoto and Toshiaki Tanaka},
title = {Efficient Implementation of the Pairing on Mobilephones using BREW},
howpublished = {Cryptology ePrint Archive, Paper 2007/340},
year = {2007},
note = {\url{https://eprint.iacr.org/2007/340}},
url = {https://eprint.iacr.org/2007/340}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.