A New Low Complexity Parallel Multiplier for a Class of Finite Fields

Authors:
Manuel Leone
Affiliations:
-
Venue:
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Year:
2001

Citing 8
Cited 2

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
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
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
VLSI Designs for Multiplication over Finite Fields GF (2m)

AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

A non-redundant and efficient architecture for karatsuba-ofman algorithm

ISC'05 Proceedings of the 8th international conference on Information Security
Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new low complexity parallel multiplier for characteristic two finite fields GF(2m) is proposed. In particular our multiplier works with field elements represented through both Canonical Basis and Type I Optimal Normal Basis (ONB), provided that the irreducible polynomial generating the field is an All One Polynomial (AOP). The main advantage of the scheme is the resulting space complexity, significantly lower than the one provided by the other fast parallel multipliers currently available in the open literature and belonging to the same class.