Efficient circuits for multiplying in GF(2m) for certain values of m

Authors:
Jack Keil Wolf
Affiliations:
-
Venue:
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Year:
1992

Citing 0
Cited 4

A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits

IEEE Transactions on Computers
Finite Field Multiplier Using Redundant Representation

IEEE Transactions on Computers
On "A New Representation of Elements of Finite Fields GF (2^m) Yielding Small Complexity Arithmetic Circuits"

IEEE Transactions on Computers
A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract