 |
Journal articles
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
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.
Cited literature [11 references]
https://hal.archives-ouvertes.fr/hal-00813621
Contributor : Christophe Negre <>
Submitted on : Tuesday, April 16, 2013 - 9:07:59 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Long-term archiving on: : Monday, April 3, 2017 - 5:33:57 AM
Contributor : Christophe Negre <>
Submitted on : Tuesday, April 16, 2013 - 9:07:59 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Long-term archiving on: : Monday, April 3, 2017 - 5:33:57 AM
File
hasan-negre-dickson-basis9-fin...
Files produced by the author(s)