Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
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
Supersingular Curves in Cryptography
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hardware Implementation of Finite Fields of Characteristic Three
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Constructing elliptic curves with prescribed embedding degrees
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Efficient GF(pm) arithmetic architectures for cryptographic applications
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Aggregated path authentication for efficient BGP security
Proceedings of the 12th ACM conference on Computer and communications security
Formulas for cube roots in F3m
Discrete Applied Mathematics
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
Journal of Systems Architecture: the EUROMICRO Journal
Hardware architectures for the Tate pairing over GF(2m)
Computers and Electrical Engineering
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
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Arithmetic Operators for Pairing-Based Cryptography
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded 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
FPGA and ASIC implementations of the ηT pairing in characteristic three
Computers and Electrical Engineering
Multiplication over Fpm on FPGA: a survey
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and 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 flexible processor for the characteristic 3 ηT pairing
International Journal of High Performance Systems Architecture
A new bit-serial multiplier over GF(pm) using irreducible trinomials
Computers & Mathematics with Applications
On the distribution of irreducible trinomials over F3
Finite Fields and Their Applications
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
| Hi-index | 0.00 |
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core computational task is evaluation of a bilinear map, or pairing, over elliptic curves. In this paper we prototype and evaluate polynomial and normal basis field arithmetic on an FPGA device and use it to construct a hardware accelerator for pairings over fields of characteristic three. The performance of our prototype improves roughly ten-fold on previous known hardware implementations and orders of magnitude on the fastest known software implementation. As a result we reason that even on constrained devices one can usefully evaluate the pairing, a fact that gives credence to the idea that identity based cryptography is an ideal partner for identity aware smart-cards.