Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields

Akleylek S., CENK M., ÖZBUDAK F.

25th International Symposium on Computer and Information Sciences, ISCIS 2010, London, England, 22 - 24 September 2010, vol.62 LNEE, pp.405-408 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 62 LNEE
  • Doi Number: 10.1007/978-90-481-9794-1_75
  • City: London
  • Country: England
  • Page Numbers: pp.405-408
  • Keywords: elliptic curve cryptography, Montgomery modular multiplication, public key cryptography, VLSI implementation
  • Ondokuz Mayıs University Affiliated: No


In this paper, we give faster versions of Montgomery modular multiplication algorithm without pre-computational phase for GF(p) and GF(2m ) which can be considered as a generalization of [3], [4] and [5]. We propose sets of moduli different than [3], [4] and [5] which can be used in PKC applications. We show that one can obtain efficient Montgomery modular multiplication architecture in view of the number of AND gates and XOR gates by choosing proposed sets of moduli. We eliminate precomputational phase with proposed sets of moduli. These methods are easy to implement for hardware. © 2011 Springer Science+Business Media B.V.