Carry-Save Implementation of RNS Montgomery Modular Multiplication using a New Carry-Save Scheme

Hardware implementation of the most publickeycryptosystems is efficiently performed via the recurrenceapplication of the residue number system in the Montgomerymodular multiplication. The most common countermeasure fordifferential power analysis attack is random switching betweena large moduli sets pool which the generic modularmultiplication and modular addition operations are required.These operations are realized via multiple additions andseveral multiplication operations. The required additionoperations could be removed via a new carry-save scheme. Theimplementation results shows ۲.۷%, ۵.۳%, and ۹.۳% lessmodular Montgomery multiplication delay for channel width۱۶-, ۳۲-, and ۶۴-bit, respectively. The analytical improvementcan be achieved by efficient optimization of the clock pulseperiod. The area consumption is increased by ۴۵%, ۴۶%, and۵۲% for the aforementioned channel widths, respectively.

کلیدواژه ها:

Montgomery modular multiplication ، Residue number system ، Carry-save format ، Waigthed twit-set