Equally Spaced Polynomials, Dual Bases, and Multiplication in F2^n

Authors:
Dieter Gollmann
Affiliations:
Microsoft Research Ltd., Thomson Avenue, Cambridge, UK
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 8
Cited 1

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Bit serial multiplication in finite fields

SIAM Journal on Discrete Mathematics
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 Multipliers for a Class of Finite Fields

IEEE Transactions on Computers
Dual bases and bit-serial multiplication in Fqn

Theoretical Computer Science - Special issue: cryptography
Architecture For A Low Complexity Rate-Adaptive Reed-Solomon Encoder

IEEE Transactions on Computers
Efficient computations in finite fields with cryptographic significance

Efficient computations in finite fields with cryptographic significance
Generation of canonical M-sequences and dual bases

IEEE Transactions on Information Theory

Hardware architectures for public key cryptography

Integration, the VLSI Journal

Quantified Score

Hi-index	14.98

Visualization

Abstract

A recently proposed multiplier for finite fields given by equally spaced polynomials is based on the transformation from the polynomial basis to its dual basis, combined with multiplication by a constant. We classify the constants that are optimal regarding the cost of this operation and investigate the cost of the inverse transformation.