Fixed base windowing combination algorithm for large integer modular exponentiation
大整数模幂的固定基窗口组合算法

Modular exponentiation is an important operation of public-key cryptosystems, which heavily determines the overall implementation of the efficiency of a public-key cryptosystems. This paper proposed a new modular exponentiation algorithm named fixed base windowing algorithm. By precomputation, this algorithm utilized the fixed base windowing algorithm of scalar multiplication of elliptic curve combined with SMM algorithm to compute gk mod n. Furthermore, it presented the principle and efficiency analysis of the new algorithm. At last, experimental results show that the computational efficiency has been increased effectively.