An Algorithm to Design Finite Field Multipliers Using a Self-Dual Normal Basis

Authors:
C. C. Wang
Affiliations:
California Institute of Technology, Pasadena
Venue:
IEEE Transactions on Computers
Year:
1989

Citing 2
Cited 7

VLSI Architectures for Computing Multiplications and Inverses in GF(2m)

IEEE Transactions on Computers
Normal basis of finite GF(2:OSm:OE)

IEEE Transactions on Information Theory

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases

IEEE Transactions on Computers
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Hardware architectures for public key cryptography

Integration, the VLSI Journal
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases

IEEE Transactions on Computers
Unified parallel systolic multiplier over GF(2m)

Journal of Computer Science and Technology
Low-complexity bit-parallel multiplier over GF(2m) using dual basis representation

Journal of Computer Science and Technology
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm

Computers and Electrical Engineering

Quantified Score

Hi-index	14.99

Visualization

Abstract

The concept of using a self-dual normal basis to design the Massey-Omura finite-field multiplier is presented. An algorithm is given to locate a self-dual normal basis for GF(2/sup m/) for odd m. A method to construct the product function for designing the Massey-Omura multiplier is developed. It is shown that the construction of the product function based on a self-dual basis is simpler than that based on an arbitrary normal basis.