Subquadratic binary field multiplier in double polynomial system

Authors

Pascal Giorgi, Universite de Perpignan
Christophe Negre, Universite de Perpignan
Thomas Plantard, University of WollongongFollow

RIS ID

32465

Publication Details

Giorgi, P., Negre, C. & Plantard, T. (2007). Subquadratic binary field multiplier in double polynomial system. International Conference on Information Security and Cryptography (pp. 229-236). Madeira, Portugal: INSTICC Press.

Abstract

We propose a new space efficient operator to multiply elements lying in a binary field F_2^k . Our approach is based on a novel system of representation called Double Polynomial System which set elements as a bivariate polynomials over F₂. 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.

Link to publisher version (URL)

International Conference on Information Security and Cryptography