%0 Conference Proceedings %T Small FPGA based Multiplication-Inversion Unit for Normal Basis Representation in $GF(2^m)$ %+ Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (CAIRN) %A Métairie, Jérémy %A Tisserand, Arnaud %A Casseau, Emmanuel %< avec comité de lecture %B ISVLSI: IEEE Computer Society Annual Symposium on VLSI %C Montpellier, France %8 2015-07-08 %D 2015 %K halving scalar multiplication %K finite-field arithmetic %K binary fields %K normal basis %K multiplication %K inversion %K ECC %Z Computer Science [cs]/Computer Arithmetic %Z Computer Science [cs]/Hardware Architecture [cs.AR] %Z Computer Science [cs]/Cryptography and Security [cs.CR]Conference papers %X 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. %G English %2 https://inria.hal.science/hal-01175712/document %2 https://inria.hal.science/hal-01175712/file/article.pdf %L hal-01175712 %U https://inria.hal.science/hal-01175712 %~ INSTITUT-TELECOM %~ UNIV-RENNES1 %~ CNRS %~ INRIA %~ UNIV-UBS %~ INSA-RENNES %~ INRIA-RENNES %~ IRISA %~ IRISA_SET %~ INRIA_TEST %~ TESTALAIN1 %~ CENTRALESUPELEC %~ IRISA-D3 %~ INRIA2 %~ UR1-HAL %~ UR1-MATH-STIC %~ UR1-UFR-ISTIC %~ TEST-UNIV-RENNES %~ TEST-UR-CSS %~ UNIV-RENNES %~ INRIA-RENGRE %~ INSTITUTS-TELECOM %~ ANR %~ UR1-MATH-NUM