Automatic Generation of Modular Multipliers for FPGA Applications

Abstract : Since redundant number systems allow constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed, PKC involves large operands (160 to 1024 bits) and several researchers proposed carry-save or borrow-save algorithms. However, these number systems do not take advantage of the dedicated carry logic available in modern Field Programmable Gate Arrays (FPGAs). To overcome this problem, we suggest to perform modular multiplication in a high-radix carry-save number system, where a sum bit of the carry-save representation is replaced by a sum word. Two digits are then added by means of a small Carry-Ripple Adder (CRA). Furthermore, we propose an algorithm which selects the best high-radix carry-save representation for a given modulus, and generates a synthesizable VHDL description of the operator.
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2008, 57 (12), pp.1600-1613. 〈10.1109/TC.2008.102〉
Liste complète des métadonnées

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

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00122716
Contributeur : Jean-Michel Muller <>
Soumis le : lundi 24 novembre 2008 - 10:48:01
Dernière modification le : mardi 24 avril 2018 - 13:52:32
Document(s) archivé(s) le : samedi 26 novembre 2016 - 02:48:13

Fichier

TC-0003-0107-2.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

Citation

Jean-Michel Muller, Jean-Luc Beuchat. Automatic Generation of Modular Multipliers for FPGA Applications. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2008, 57 (12), pp.1600-1613. 〈10.1109/TC.2008.102〉. 〈ensl-00122716v3〉

Partager

Métriques

Consultations de la notice

146

Téléchargements de fichiers

90