JELE_V6_N4_RP5
Analysis of Modular Multipliers
Tallaka Yamini
A.B. Yadav
Koppala Neelima
Journal on Electronics Engineering
2249 – 0760
6
4
24
30
Carry-Save Addition, Montgomery Multiplication, Interleaved Multiplication, Public-Key Cryptosystems
This paper proposes a simple and efficient Modular Multiplication algorithm. Montgomery modular multipliers can be implemented accordingly. Based on the Montgomery technique, both SCS and FCS are used by the Carry save format and also the modified SCA. The proposed SCS have used CCSA. To increase the performance of the cryptosystem, the modular multiplication is interleaved by serial and parallel radix-4 modular multipliers and also the same for normal multiplication. By comparing this technique, critical path and clock cycles are reduced. Now these techniques are used in Verilog HDL Virtex-3E using Xilinx ISE 14.5 design suite.
June – August 2016
Copyright © 2016 i-manager publications. All rights reserved.
i-manager Publications
http://www.imanagerpublications.com/Article.aspx?ArticleId=8090