A Coprocessor for the Final Exponentiation of the ηTPairing in Characteristic Three
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Some Efficient Algorithms for the Final Exponentiation of ηT Pairing
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Reduction Optimal Trinomials for Efficient Software Implementation of the ηT Pairing
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Implementation of the Pairing on Mobilephones Using BREW
IEICE - Transactions on Information and Systems
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Signcryption from randomness recoverable public key encryption
Information Sciences: an International Journal
FPGA and ASIC implementations of the ηT pairing in characteristic three
Computers and Electrical Engineering
Reduction optimal trinomials for efficient software implementation of the ηT pairing
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Universal ηT pairing algorithm over arbitrary extension degree
WISA'07 Proceedings of the 8th international conference on Information security applications
Efficient implementation of the pairing on mobilephones using BREW
WISA'07 Proceedings of the 8th international conference on Information security applications
An efficient countermeasure against side channel attacks for pairing computation
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
A new bit-serial multiplier over GF(pm) using irreducible trinomials
Computers & Mathematics with Applications
Faster and lower memory scalar multiplication on supersingular curves in characteristic three
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
| Hi-index | 0.01 |
In this paper, we propose a modified çT pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.