Abstract : 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.
https://hal.archives-ouvertes.fr/hal-00813621 Contributor : Christophe NegreConnect in order to contact the contributor Submitted on : Tuesday, April 16, 2013 - 9:07:59 AM Last modification on : Tuesday, March 15, 2022 - 12:55:40 PM Long-term archiving on: : Monday, April 3, 2017 - 5:33:57 AM
Anwar Hasan, Christophe Negre. Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (4), pp.602-607. ⟨hal-00813621⟩