On the generalisation of special moduli for faster interleaved montgomery modular multiplication
In this study, the authors give a generalisation of special moduli for faster interleaved Montgomery modular multiplication algorithm with simplified pre-computational phase for GF(p(n)), where p 2 is a prime number and n is a positive integer. The authors propose different sets of moduli that can be used in elliptic curve crytographic applications and pairing-based cryptography. Moreover, this method also leads to efficient implementations for the elliptic curve parameters given in standards. It is shown 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. The authors eliminate final substraction step with proposed sets of moduli. These methods are easy to implement for hardware.
faster interleaved montgomery modular multiplication algorithm prime number positive integer elliptic curve crytographic applications pairing-based cryptography elliptic curve parameters and gates xor gates logic gates multiplying circuits public key cryptography moduli generalisation simplified precomputational phase