Cryptology ePrint Archive: Report 2007/340

Efficient Implementation of the Pairing on Mobilephones using BREW

Motoi Yoshitomi and Tsuyoshi Takagi and 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.

Category / Keywords: implementation / pairing based cryptosystem, mobilephone, BREW

Publication Info: This is a full version of WISA 2007 paper.

Date: received 28 Aug 2007, last revised 12 Sep 2007

Contact author: takagi at fun ac jp

Available format(s): PDF | BibTeX Citation

Version: 20070913:054632 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]