Modified radix-2 Montgomery modular multiplication to make it faster and simpler

Author

Manochehri, Kooroush ; Pourmozafari, Saadat

Author_Institution

Dept. of Comput. Eng. & IT, Amirkabir Univ. of Technol., Tehran, Iran

Volume

1

fYear

2005

fDate

4-6 April 2005

Firstpage

598

Abstract

Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several improvements for making it suitable for hardware implementation. Radix-2 version of this algorithm is simple and fast to implement in hardware design. In this paper a new algorithm based on this approach is presented that is more simple and faster than radix-2 algorithm. For implementing this new algorithm, carry save adder (CSA) architecture is used and synthesized in both ASIC and FPGA technology.

Keywords

adders; application specific integrated circuits; cryptography; digital arithmetic; field programmable gate arrays; ASIC; CSA architecture; FPGA; RSA cryptosystem; carry save adder; hardware design; modular arithmetic; radix-2 Montgomery modular multiplication; radix-2 algorithm; Algorithm design and analysis; Application specific integrated circuits; Clocks; Computer architecture; Data security; Digital arithmetic; Field programmable gate arrays; Hardware; Public key cryptography; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on

Print_ISBN

0-7695-2315-3

Type

conf

DOI

10.1109/ITCC.2005.204

Filename

1428528