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-Energy Digit-Serial/Parallel Finite Field Multipliers
Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
Parallel Hardware Architectures for the Cryptographic Tate Pairing
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
Journal of Systems Architecture: the EUROMICRO Journal
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
Hardware architectures for the Tate pairing over GF(2m)
Computers and Electrical Engineering
Elliptic Curves: Number Theory and Cryptography, Second Edition
Elliptic Curves: Number Theory and Cryptography, Second Edition
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
ICONS '08 Proceedings of the Third International Conference on Systems
A FPGA Coprocessor for the Cryptographic Tate Pairing over Fp
ITNG '08 Proceedings of the Fifth International Conference on Information Technology: New Generations
Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
IEEE Transactions on Computers
FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field
Journal of Systems Architecture: the EUROMICRO Journal
Explicit formulas for efficient multiplication in F36m
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
A flexible processor for the characteristic 3 ηT pairing
International Journal of High Performance Systems Architecture
Efficient tate pairing computation for elliptic curves over binary fields
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
High security pairing-based cryptography revisited
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hardware acceleration of the tate pairing in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Efficient hardware for the tate pairing calculation in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Pairing-Based cryptography at high security levels
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Field inversion and point halving revisited
IEEE Transactions on Computers
IEEE Transactions on Information Theory
Reducing elliptic curve logarithms to logarithms in a finite field
IEEE Transactions on Information Theory
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Network-on-Chip interconnect for pairing-based cryptographic IP cores
Journal of Systems Architecture: the EUROMICRO Journal
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
NOCS '11 Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip
Hi-index | 0.00 |
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. As they rely critically on efficient implementations of pairing primitives, the study of hardware accelerators has become an active research area. In this paper, we propose two coprocessors for the reduced @h"T pairing introduced by Barreto et al. as an alternative means of computing the Tate pairing on supersingular elliptic curves. We prototyped our architectures on FPGAs. According to our place-and-route results, our coprocessors compare favorably with other solutions described in the open literature. We eventually present the first ASIC implementation of the reduced @h"T pairing.