## CryptoDB

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

Authors: Motoi Yoshitomi Tsuyoshi Takagi Shinsaku Kiyomoto Toshiaki Tanaka URL: http://eprint.iacr.org/2007/340 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2007-13620,
title={Efficient Implementation of the Pairing on Mobilephones using BREW},
booktitle={IACR Eprint archive},
keywords={implementation / pairing based cryptosystem, mobilephone, BREW},
url={http://eprint.iacr.org/2007/340},
note={This is a full version of WISA 2007 paper. takagi@fun.ac.jp 13769 received 28 Aug 2007, last revised 12 Sep 2007},
author={Motoi Yoshitomi and Tsuyoshi Takagi and Shinsaku Kiyomoto and Toshiaki Tanaka},
year=2007
}