Low-Energy Digit-Serial/Parallel Finite Field Multipliers
Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
Hardware Implementation of Finite Fields of Characteristic Three
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three
IEEE Transactions on Computers
Parallel Hardware Architectures for the Cryptographic Tate Pairing
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
An Embedded Processor for a Pairing-Based Cryptosystem
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
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
Multiplication over Fpm on FPGA: a survey
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Efficient GF(pm) arithmetic architectures for cryptographic applications
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
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
| Hi-index | 0.09 |
Pairing-based schemes, such as identity-based cryptosystem, are widely used for future computing environments. Hence the work of hardware architectures for GF(p^m) has been brought to public attention for the past few years since most of the pairing-based schemes are implemented using arithmetic operations over GF(p^m) defined by irreducible trinomials. This paper proposes a new most significant elements (MSE)-first serial multiplier for GF(p^m), where p2, which is more efficient than least significant elements (LSE)-first multipliers from the point of view of both the time delay and the size of registers. In particular, the proposed multiplier has an advantage when the extension degree of finite fields m is large and the characteristic of finite fields p is small like GF(3^m), GF(5^m), and GF(7^m) used in pairing-based cryptosystems.