Faster modular implementation on cryptography

Abstract EN

A new precipitation method is presented for modular multiplication for a fixed modulus.

The proposed method is more efficient than the known methods that are oriented for variable module, especially in a case software implementation of modular multiplication on low bit microcontrollers and smart cards.

In this case the performance of our method is approximately twice as high in comparison to Montgomery algorithm and the amount of required storage is moderate.