International Journal of Engineering Research

Ebin Geo Johnson ¹, K. Neethu ²

Affiliations
1 Electronics and Communication, Reva Institute of Technology, Bangalore, 560064, IN
2 Department of Electronics and Communication, Reva University, Bangalore, 560064, IN

Abstract

Various Modular multiplication techniques are developed for the multiplication of large integers. In this paper the focus is mainly on the Montgomery algorithm for modular multiplication (MM), the basic Montgomery's algorithm that has been modified for improvement in performance and area time product in different designs are reviewed, and the improvements made in the algorithm of each designs are traced in a sequential manner from the initial. This starts with the various alterations in the basic algorithm using carry save adders (CSA) to eliminate the carry propagation that are long in large binary operations and the format conversion issues which will increase required clock cycles in the designs while converting the carry save format to binary representation are reviewed. Future scope of the design modification for reduced delay in critical path and hardware cost when compared with previous designs are discussed.

Keywords

Montgomery Modular Multiplier, Public Key Cryptosystem, Carry Save Addition.

Full Text