VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
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
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
IEEE Transactions on Computers
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Efficient Software Implementation for Finite Field Multiplication in Normal Basis
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
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
Hardware Implementation of Finite Fields of Characteristic Three
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Efficient GF(pm) arithmetic architectures for cryptographic applications
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Software Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Versatile hardware architectures for GF(pm) arithmetic in public key cryptography
Integration, the VLSI Journal - Special issue: Embedded cryptographic hardware
Efficient Multiplication Using Type 2 Optimal Normal Bases
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
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
Some efficient algorithms for the final exponentiation of ηT pairing
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
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
A reconfigurable implementation of the tate pairing computation over GF(2m)*
ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Solving a 676-bit discrete logarithm problem in GF(36n)
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Side channel attacks and countermeasures on pairing based cryptosystems over binary fields
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Key length estimation of pairing-based cryptosystems using ηT pairing
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Breaking pairing-based cryptosystems using ηT pairing over GF(397)
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hi-index | 14.99 |
Although identity-based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing, which, in characteristic three, is best computed using the algorithm of Duursma and Lee. However, in hardware and constrained environments, this algorithm is unattractive since it requires online computation of cube roots or enough storage space to precompute required results. We examine the use of normal basis arithmetic in characteristic three in an attempt to get the best of both worlds: an efficient method for computing the Tate pairing that requires no precomputation and that may also be implemented in hardware to accelerate devices such as smart-cards.