Analyzing and Researching Montgomery Algorithm

Liu Bianjian · Science Technology and Engineering · 2006

Montgomery algorithm is a fast modular multiplication algorithm and has been widely used in the base operation of public-key cryptography algorithms such as RSA and ElGamal. The algorithm is analyzed deeply and deduced systematically in this paper. Then, two typical methods is realized and compared, and two other improvements is given.

Read the paper · More papers on PaperTik