On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/)

Authors:
Michele Elia;Manuel Leone
Affiliations:
Politecnico di Torino, Italy;TILAB Telecom Italia Lab, Torino, Italy
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 11
Cited 4

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

Information and Computation
Tensor rank is NP-complete

Journal of Algorithms
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
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
Double-Basis Multiplicative Inversion Over GF(2m)

IEEE Transactions on Computers
Mastrovito Multiplier for All Trinomials

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

IEEE Transactions on Computers
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields

IEEE Transactions on Computers
A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields

IEEE Transactions on Computers

Efficient Multiplication Beyond Optimal Normal Bases

IEEE Transactions on Computers
Efficient digit-serial normal basis multipliers over binary extension fields

ACM Transactions on Embedded Computing Systems (TECS)
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases

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

Computational Intelligence and Security

Quantified Score

Hi-index	14.99

Visualization

Abstract

A lower bound to the number of AND gates used in parallel multipliers for $GF(2/supm/)$, under the condition that time complexity be minimum, is determined. In particular, the exact minimum number of AND gates for Primitive Normal Bases and Optimal Normal Bases of Type II multipliers is evaluated. This result indirectly suggests that space complexity is essentially a quadratic function of $m$ when time complexity is kept minimum.