Small FPGA based Multiplication-Inversion Unit for Normal Basis Representation in $GF(2^m)$ - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2015

Small FPGA based Multiplication-Inversion Unit for Normal Basis Representation in $GF(2^m)$

Abstract

Halving methods have been proposed for parallel implementation of ECC primitives on multicore processors. In hardware, they can also provide protection against some side channel attacks (thanks to parallel independent operations). But they require affine coordinates for curve points and costly inversions. We propose a new combined multiplication-inversion unit for binary field extensions and halving based ECC methods optimized for FPGAs. We target small area solutions compared to very fast but costly ones from state-of-art. Our solution is based on permuted normal basis, Massey-Omura multiplication and Itoh-Tsujii inversion algorithms. Our FPGA implementations show better efficiency for large fields.
Fichier principal
Vignette du fichier
article.pdf (357.76 Ko) Télécharger le fichier
slides-isvlsi2015.pdf (1007.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01175712 , version 1 (16-07-2015)

Identifiers

  • HAL Id : hal-01175712 , version 1

Cite

Jérémy Métairie, Arnaud Tisserand, Emmanuel Casseau. Small FPGA based Multiplication-Inversion Unit for Normal Basis Representation in $GF(2^m)$. ISVLSI: IEEE Computer Society Annual Symposium on VLSI, Jul 2015, Montpellier, France. ⟨hal-01175712⟩
353 View
789 Download

Share

More