VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Introduction to finite fields and their applications
Introduction to finite fields and their applications
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
IEEE Transactions on Computers - Special issue on computer arithmetic
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
IEEE Transactions on Computers
Storage-Efficient Finite Field Basis Conversion
SAC '98 Proceedings of the Selected Areas in Cryptography
A Low-Power Design for an Elliptic Curve Digital Signature Chip
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
IEEE Transactions on Computers
A New Parallel Multiplier for Type II Optimal Normal Basis
Computational Intelligence and Security
Modified serial multipliers for Type-IV gaussian normal bases
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Information Processing Letters
| Hi-index | 14.98 |
The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier the type I optimal normal basis.