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
Contributeur : Christophe Negre
<>
Soumis le : mardi 16 avril 2013 - 09:07:59
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : lundi 3 avril 2017 - 05:33:57
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〉
