SUBQUADRATIC BINARY FIELD MULTIPLIER IN DOUBLE POLYNOMIAL SYSTEM

Pascal Giorgi, Christophe Nègre, Thomas Plantard

2007

Abstract

We propose a new space efficient operator to multiply elements lying in a binary field F2k . Our approach is based on a novel system of representation called Double Polynomial System which set elements as a bivariate polynomials over F2 . 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(k1.31 ) improving previous best known method.

Paper Citation

in Harvard Style

Giorgi P., Nègre C. and Plantard T. (2007). SUBQUADRATIC BINARY FIELD MULTIPLIER IN DOUBLE POLYNOMIAL SYSTEM . In Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007) ISBN 978-989-8111-12-8, pages 229-236. DOI: 10.5220/0002126102290236

in Bibtex Style

@conference{secrypt07,
author={Pascal Giorgi and Christophe Nègre and Thomas Plantard},
title={SUBQUADRATIC BINARY FIELD MULTIPLIER IN DOUBLE POLYNOMIAL SYSTEM},
booktitle={Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)},
year={2007},
pages={229-236},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002126102290236},
isbn={978-989-8111-12-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2007)
TI - SUBQUADRATIC BINARY FIELD MULTIPLIER IN DOUBLE POLYNOMIAL SYSTEM
SN - 978-989-8111-12-8
AU - Giorgi P.
AU - Nègre C.
AU - Plantard T.
PY - 2007
SP - 229
EP - 236
DO - 10.5220/0002126102290236