A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values

Abstract : In this paper we provide a comparison of different modular multipliers suitable for use in an elliptic curve processor, when working with a Mersenne prime modulus. Mersenne primes allow for the use of fast modular reduction techniques. Several multipliers are presented that can be implemented solely in slice logic. A design that makes use of the DSP48E blocks on Virtex 5 FPGAs is also described. The different multipliers are compared for speed, area and power consumption when implemented on a Virtex 5 FPGA
Type de document :
Communication dans un congrès
21st International Conference on Field Programmable Logic and Applications (FPL), Sep 2011, Chania, Greece. IEEE, pp.273-276, 2011, 〈10.1109/FPL.2011.55〉
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00633200
Contributeur : Arnaud Tisserand <>
Soumis le : lundi 17 octobre 2011 - 19:11:41
Dernière modification le : vendredi 16 novembre 2018 - 01:39:02
Document(s) archivé(s) le : mercredi 18 janvier 2012 - 02:35:27

Fichier

fpl11.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Mark Hamilton, William Marnane, Arnaud Tisserand. A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values. 21st International Conference on Field Programmable Logic and Applications (FPL), Sep 2011, Chania, Greece. IEEE, pp.273-276, 2011, 〈10.1109/FPL.2011.55〉. 〈inria-00633200〉

Partager

Métriques

Consultations de la notice

325

Téléchargements de fichiers

5510