Introduction to finite fields and their applications
Introduction to finite fields and their applications
Fast Combinatorial RNS Processors for DSP Applications
IEEE Transactions on Computers
GF(2m) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on 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
A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme
IEEE Transactions on Computers
Efficient GF(pm) arithmetic architectures for cryptographic applications
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis
IEEE Transactions on Computers
Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over $GF(2^{m})$
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.89 |
In this paper, we propose a parallel multiplier over arbitrary finite field GF(p^m). In particular, we apply the proposed multiplier to GF(3^m) defined by irreducible trinomial which has received a great interest recently. The proposed GF(3^m) multiplier is not only the first parallel multiplier with explicit complexities, but its complexities also match with generalized forms of the complexities of the most efficient GF(2^m) multiplier.