Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m)

Authors:
Soonhak Kwon;Heuisu Ryu
Affiliations:
-;-
Venue:
ISC '02 Proceedings of the 5th International Conference on Information Security
Year:
2002

Citing 7
Cited 0

A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases

IEEE Transactions on Computers
Bit serial multiplication in finite fields

SIAM Journal on Discrete Mathematics
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields

IEEE Transactions on Computers
A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits

IEEE Transactions on Computers
An Efficient Optimal Normal Basis Type II Multiplier

IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields

IEEE Transactions on Computers
A New Aspect of Dual Basis for Efficient Field Arithmetic

PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the self duality of an optimal normal basis of type II in a finite field GF(2m), we present a design of a bit serial multiplier of Berlekamp type. It is shown that our multiplier does not need a basis conversion process and a squaring operation is a simple permutation in our basis. Therefore our multiplier provides a fast and an efficient hardware architecture for a bit serial multiplication of two elements in GF(2m), which is suitable for a cryptographic purpose.