Subquadratic Binary Field Multiplier in Double Polynomial System

Abstract : We propose a new space efficient operator to multiply elements lying in a binary field GF(2^k). Our approach is based on a novel system of representation called "Double Polynomial System" which set elements as a bivariate polynomials over GF(2). Thanks to this system of representation, we are able to use a Lagrange representation of the polynomials and then get a logarithmic time multiplier with a space complexity of O(k^1.31) improving previous best known method.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00140082
Contributor : Pascal Giorgi <>
Submitted on : Wednesday, April 4, 2007 - 6:41:05 PM
Last modification on : Wednesday, April 4, 2007 - 9:11:12 PM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 10:35:49 PM

File

dps-fft.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00140082, version 1

Collections

Citation

Pascal Giorgi, Christophe Negre, Thomas Plantard. Subquadratic Binary Field Multiplier in Double Polynomial System. 2007. <hal-00140082>

Share

Metrics

Record views

191

Document downloads

58