Paper 2007/340 Original: eprint.iacr.org/2007/340 ↗
Efficient Implementation of the Pairing on Mobilephones using BREW
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2007-09-13: last updated
- 2007-08-29: published
- Short URL
- https://ia.cr/2007/340
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2007/340}
}