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

Authors:
Willi Geiselmann;Jörn Müller-Quade;Rainer Steinwandt
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 7
Cited 1

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

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

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits

IEEE Transactions on Computers
Highly Regular Architectures for Finite Field Computation Using Redundant Basis

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Fast Multiplication in Finite Fields GF(2N)

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Rings of Low Multiplicative Complexity

Finite Fields and Their Applications

A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

We characterize the smallest n with GF (2) [X] /(X^n+1) containing an isomorphic copy of GF(2^m). This characterization shows that the representation of finite fields described in a previous issue of the IEEE Transactions on Computers is not "optimal" as claimed. The representation considered there can often be improved significantly.