A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Elliptic curves in cryptography
Elliptic curves in cryptography
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Elliptic Curve Cryptosystems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Fast Software Implementation for Arithmetic Operations in GF(2n)
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: 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
Fast arithmetic architectures for public-key algorithms over Galois fields GF((2n)m)
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
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
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Computational Intelligence and Security
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
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
A versatile Montgomery multiplier architecture with characteristic three support
Computers and Electrical Engineering
Some Efficient Algorithms for the Final Exponentiation of η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
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
Some efficient algorithms for the final exponentiation of ηT pairing
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Multiplication over Fpm on FPGA: a survey
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Explicit formulas for efficient multiplication in F36m
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
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
Efficient multiplication in F3lm, m ≥ 1 and 5 ≤ l ≤ 18
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
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
How to secure multi-domain wireless mesh networks
Wireless Networks
Compact hardware for computing the tate pairing over 128-bit-security supersingular curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Key length estimation of pairing-based cryptosystems using ηT pairing
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
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
Traitor tracing with optimal transmission rate
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
In this paper the benefits of implementation of the Tate pairing computation on dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF(36m) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field GF(3m). Using this approach, an architecture for the hardware implementation of the Tate pairing calculation based on a modified Duursma-Lee algorithm is proposed.