Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields

Authors:
Huapeng Wu;M. Anwarul Hasan
Affiliations:
Univ. of Waterloo, Ont., Canada;Univ. of Waterloo, Ont., Canada
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 6
Cited 20

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

IEEE Transactions on Computers
Optimal normal bases in GF(pn)

Discrete Applied Mathematics
Structure of parallel multipliers for a class of fields GF(2m)

Information and Computation
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
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields

IEEE Transactions on Computers
GF(2m) Multiplication and Division Over the Dual Basis

IEEE Transactions on Computers

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

IEEE Transactions on Computers
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials

IEEE Transactions on Computers
Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials

IEEE Transactions on Computers
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})

IEEE Transactions on Computers
Equally Spaced Polynomials, Dual Bases, and Multiplication in F2^n

IEEE Transactions on Computers
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

Designs, Codes and Cryptography
Highly Regular Architectures for Finite Field Computation Using Redundant 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
Parallel Multipliers Based on Special Irreducible Pentanomials

IEEE Transactions on Computers
Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation

IEEE Transactions on Computers
Bit-Parallel Finite Field Multipliers for Irreducible Trinomials

IEEE Transactions on Computers
A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme

IEEE Transactions on Computers
A New Parallel Multiplier for Type II Optimal Normal Basis

Computational Intelligence and Security
An optimized design for serial-parallel finite field multiplication over GF(2m) based on all-one polynomials

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Unified parallel systolic multiplier over GF(2m)

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

Computers and Electrical Engineering
A high-speed word level finite field multiplier in F2m using redundant representation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low-complexity bit-parallel multipliers for a class of GF(2m) based on modified Booth's algorithm

International Journal of Computers and Applications
Modified serial multipliers for Type-IV gaussian normal bases

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm

Information Processing Letters

Quantified Score

Hi-index	15.01

Visualization

Abstract

New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal to those of the previously proposed multipliers of the same class.