Finite Field Multiplier Architectures for Hyper-Elliptic Curve Cryptography
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
