Automatic Generation of Modular Multipliers for FPGA Applications - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2008

Automatic Generation of Modular Multipliers for FPGA Applications

(1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
TC-0003-0107-2.pdf (4.43 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

ensl-00122716 , version 1 (04-01-2007)
ensl-00122716 , version 2 (24-08-2007)
ensl-00122716 , version 3 (24-11-2008)

Identifiers

Cite

Jean-Michel Muller, Jean-Luc Beuchat. Automatic Generation of Modular Multipliers for FPGA Applications. IEEE Transactions on Computers, 2008, 57 (12), pp.1600-1613. ⟨10.1109/TC.2008.102⟩. ⟨ensl-00122716v3⟩
239 View
325 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More