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 elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Hasan, M. A., & Negre, C. (2008). Subquadratic space complexity multiplication over binary fields with Dickson polynomial representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5130 LNCS, pp. 88–102). https://doi.org/10.1007/978-3-540-69499-1_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
