Handbook of Applied Cryptography
Handbook of Applied Cryptography
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
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
A comparison of MNT curves and supersingular curves
Applicable Algebra in Engineering, Communication and Computing
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
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Efficient hardware for the tate pairing calculation in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Efficient implementation of pairing on BREW mobile phones
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
| Hi-index | 0.00 |
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 ηT pairing. In this paper, we present an efficient implementation of the pairing over some mobilephones. Moreover, we compare the processing speed of the pairing with that of the other standard public key cryptosystems, i.e. RSA cryptosystem and elliptic curve cryptosystem. Indeed the processing speed of our implementation in ARM9 processors on BREW achieves under 100 milliseconds using the supersingular curve over 397. In addition, the pairing is more efficient than the other public key cryptosystems, and the pairing can be achieved enough also on BREW mobilephones. It has become efficient enough to implement security applications, such as short signature, ID-based cryptosystems or broadcast encryption, using the pairing on BREW mobilephones.