A fast modular multiplication method

ŞENTÜRK A., GÖK M.

6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010, Darmstadt, Almanya, 15 - 17 Ekim 2010, ss.204-207, (Tam Metin Bildiri) identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/iihmsp.2010.58
  • Basıldığı Şehir: Darmstadt
  • Basıldığı Ülke: Almanya
  • Sayfa Sayıları: ss.204-207
  • Anahtar Kelimeler: Modular multiplication method, Multiply-add
  • Isparta Uygulamalı Bilimler Üniversitesi Adresli: Hayır

Özet

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. © 2010 IEEE.