Implementation and Analysis of the Montgomery Algorithm for the Fast RSA Crypto-System
Jun Eon An, Gi Yeong Yu · Information Security and Cryptology · 1999
Public key cryptosystem carry out the modular exponentiation of large integer for security, and the modular exponentiation is presented by the serial of the modular multiplication. This thesis presents implementation method for improving performance of modular multiplication based on the Montgomery algorithm which is known as the fastest modular multiplication algorithm. These implementation method is implemented in integer system and in Galois Field(2m), and is compared and analyzed with multiplication, addition, reading and writing memory.