Efficient implementation of pairing on BREW mobile phones

Authors:
Tadashi Iyama;Shinsaku Kiyomoto;Kazuhide Fukushima;Toshiaki Tanaka;Tsuyoshi Takagi
Affiliations:
Graduate School of Mathematics, Kyushu University, Fukuoka, Japan;KDDI R&D Laboratories Inc., Fujimino, Saitama, Japan;KDDI R&D Laboratories Inc., Fujimino, Saitama, Japan;KDDI R&D Laboratories Inc., Fujimino, Saitama, Japan;Graduate School of Mathematics, Kyushu University, Fukuoka, Japan
Venue:
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Year:
2010

Citing 11
Cited 0

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
Efficient Implementation of the Pairing on Mobilephones Using BREW

IEICE - Transactions on Information and Systems
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Efficient and generalized pairing computation on Abelian varieties

IEEE Transactions on Information Theory
Universal ηT pairing algorithm over arbitrary extension degree

WISA'07 Proceedings of the 8th international conference on Information security applications
NanoECC: testing the limits of elliptic curve cryptography in sensor networks

EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Pairing-Friendly elliptic curves of prime order

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
The Eta Pairing Revisited

IEEE Transactions on Information Theory
Implementing cryptographic pairings over barreto-naehrig curves

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many implementations of pairings on embedded devices such as mobile phones, sensor nodes, and smart cards have been developed. However, pairings at the security level equivalent to 128-bit AES key have not been implemented in mobile phones without a high-level OS such as Windows. The R-ate pairing is one of the fastest pairings over large prime fields. In this study, we implemented the R-ate pairing at the security level equivalent to 128-bit AES key on BREW mobile phones. We compared the processing time of the R-ate pairing with those of the Ate pairing and ηT pairing. In the results, the R-ate pairing was fastest pairing. Also, we compared the processing time of pairings with those of RSA and ECC on ARM9 225MHz. In the result, the processing time of the R-ate pairing was similar those of RSA and ECC.