A Fast Modular Multiplication Method

Fast execution of modular multiplication is crucial to speed-up public key cryptography applications. This paper presents a modular multiplication method that exploits high-speed multiply-accumulate instructions supported in modern general-purpose architectures. The algorithm is implemented as a C program and tested on large operands by using GNU Multiple Precision Library (GMP). The performance of the method is compared with the performance of the Montgomery´s Algorithm. The comparision results show that the proposed method runs upto 5 times faster than Montgomery´s Algorithm.