A fast modular multiplication method using Yacobi´s algorithm

Summary form only given. A fast modular multiplication method is presented. The known fastest modular multiplication method by Su and Hwang requires n+11 additions on average for an n-bit modulus. In Su and Hwang´s method, the computed values are not stored for use again. In our method, the computed values can be stored by Yacobi´s algorithm. According to our analysis, our method is faster than Su and Hwang´s when n⩾512. Furthermore, our method only requires 0.6718 n additions on average as n approaches the limit infinity