Finite Field Multiplier Architectures for Hyper-Elliptic Curve Cryptography

Gabriel Gallin 1 Arnaud Tisserand 2
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA_D3 - ARCHITECTURE
2 Lab-STICC_UBS_CACS_MOCS
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : In this work, we present a new arithmetic unit for the multiplication in prime finite fields. This modular multiplier is intended to be part of an hardware accelerator dedicated to Hyper-Elliptic Curve Cryptography. Various configurations of the multiplier have been implemented in different FPGAs. We will present the results we obtained in terms of circuit area and computation time and we will make the comparison with the actual state-of-the-art in mplementation of modular multipliers.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01539852
Contributor : Arnaud Tisserand <>
Submitted on : Thursday, June 15, 2017 - 2:48:19 PM
Last modification on : Wednesday, December 19, 2018 - 3:26:08 PM

Annex

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

  • HAL Id : hal-01539852, version 1

Citation

Gabriel Gallin, Arnaud Tisserand. Finite Field Multiplier Architectures for Hyper-Elliptic Curve Cryptography. Colloque National du GDR SOC2, Jun 2017, Bordeaux, France. ⟨http://www.colloque2017-gdrsoc2.org/⟩. ⟨hal-01539852⟩

Share

Metrics

Record views

503

Files downloads

128