Efficient implementation of the pairing on mobilephones using BREW

Authors:
Motoi Yoshitomi;Tsuyoshi Takagi;Shinsaku Kiyomoto;Toshiaki Tanaka
Affiliations:
Future University - Hakodate, School of System Information Science, Hakodate, Japan;Future University - Hakodate, School of System Information Science, Hakodate, Japan;KDDI R&D Laboratories Inc., Saitama, Japan;KDDI R&D Laboratories Inc., Saitama, Japan
Venue:
WISA'07 Proceedings of the 8th international conference on Information security applications
Year:
2007

Citing 9
Cited 1

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three

IEEE Transactions on Computers
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation

ARITH '07 Proceedings of the 18th IEEE Symposium on Computer Arithmetic
Some efficient algorithms for the final exponentiation of ηT pairing

ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Efficient hardware for the tate pairing calculation in characteristic three

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Affine pairings on ARM

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

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 Duursma-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.