Modified Montgomery Modular Inversion with Reduced Number of Multiplications

Author

Kamala, R.V. ; Srinivas, M.B.

Author_Institution

Center for VLSI & Embedded Syst. Technol., Int. Inst. of Inf. Technol., Hyderabad

fYear

2006

fDate

14-17 Nov. 2006

Firstpage

1

Lastpage

4

Abstract

In this paper, a modified algorithm to compute Montgomery modular Inverse that requires less number of Montgomery modular multiplications compared to the best known methods in literature is proposed. A method is also suggested for computing the Montgomery inverse using a modular multiplication algorithm recently proposed by Rainer et al. to compute the modular product. Our approaches are optimal in terms of computational delay and the practical efficiency has been evaluated for an operand length of 521-bit that is of interest to practical cryptographic applications. The proposed algorithms are expected to be of eminent importance for high-speed arithmetic

Keywords

cryptography; digital arithmetic; Montgomery modular inversion; high-speed arithmetic; multiplication algorithm; practical cryptographic application; Arithmetic; Delay; Elliptic curve cryptography; Embedded computing; Embedded system; Hardware; Image converters; Information technology; Public key cryptography; Very large scale integration; Cryptographic Operation; Efficient Montgomery Modular Inversion; Inversion with multiplications; Montgomery arithmetic;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON 2006. 2006 IEEE Region 10 Conference

Conference_Location

Hong Kong

Print_ISBN

1-4244-0548-3

Electronic_ISBN

1-4244-0549-1

Type

conf

DOI

10.1109/TENCON.2006.343916

Filename

4142547