Efficient Normal Basis Multipliers in Composite Fields

Authors:
Sangho Oh;Chang Han Kim;Jongin Lim;Dong Hyeon Cheon
Affiliations:
Korea Univ., Seoul, Korea;Semyung Univ., Chungbuk, Korea;Korea Univ., Seoul, Korea;Korea Univ., Seoul, Korea
Venue:
IEEE Transactions on Computers
Year:
2000

Citing 6
Cited 10

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Optimal normal bases in GF(pn)

Discrete Applied Mathematics
Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2/sup m/)

IEEE Transactions on Computers - Special issue on computer arithmetic
Efficient Multiplier Architectures for Galois Fields GF(24n)

IEEE Transactions on Computers
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

Fast Normal Basis Multiplication Using General Purpose Processors

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Efficient Multiplication Beyond Optimal Normal Bases

IEEE Transactions on Computers
Hardware architectures for public key cryptography

Integration, the VLSI Journal
Constructing Composite Field Representations for Efficient Conversion

IEEE Transactions on Computers
Fast Normal Basis Multiplication Using General Purpose Processors

IEEE Transactions on Computers
Low Complexity Word-Level Sequential Normal Basis Multipliers

IEEE Transactions on Computers
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
Concurrent Error Detection in Multiplexer-Based Multipliers for Normal Basis of GF(2m) Using Double Parity Prediction Scheme

Journal of Signal Processing Systems
Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2m)

International Journal of Autonomous and Adaptive Communications Systems

Quantified Score

Hi-index	14.99

Visualization

Abstract

It is well-known that a class of finite fields $GF(2^n)$ using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier.