Logo image
Sign in
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
Journal article   Open access   Peer reviewed

Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

Anwar Hasan and Christophe Negre
IEEE Transactions on Computers, Vol.60(4), pp.602-607
01/04/2011

Abstract

Hankel matrices Toeplitz matrices computational complexity matrix multiplication polynomial approximation
We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two field elements as Toeplitz or Hankel matrix-vector products. This provides a parallel multiplier which is subquadratic in space and logarithmic in time. Using the matrix-vector formulation of the field multiplication, we also present sequential multiplier structures with linear space complexity.
url
Find in HALView

Metrics

1 Record Views

Details

Logo image