 |
|
|
|
| HAL: hal-00140082, version 1 |
| Detailed view |  Export this paper |
|
|
|
|
| Subquadratic Binary Field Multiplier in Double Polynomial System |
|
|
| Pascal Giorgi 1Christophe Negre 1 |
|
|
| (2007-04-04) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire de Physique Appliquée et d'Automatique (LP2A) |
|
|
|
EA3679 – Université de Perpignan |
|
|
| 2: | Centre for Computer and Information Security Research |
|
|
|
University of Wollongong |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Cryptography and Security Computer Science/Computer Arithmetic Computer Science/Symbolic Computation |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00140082, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00140082 | |
| oai:hal.archives-ouvertes.fr:hal-00140082 | |
| From: Giorgi Pascal | |
| Submitted on: Wednesday, 4 April 2007 18:41:05 | |
| Updated on: Wednesday, 4 April 2007 21:11:12 | |
