%0 Journal Article
%T Fixed base windowing combination algorithm for large integer modular exponentiation<br>大整数模幂的固定基窗口组合算法
%A QU Yun-yun
%A BAO Xiao-min
%A LIU Hu
%A XU Yang
%A <br>瞿云云
%A 包小敏
%A 刘　花
%A 徐　洋
%J 计算机应用研究
%D 2013
%I 
%X 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.
%K RSA
%K modular exponentiation
%K SMM algorithm
%K fixed base windowing algorithm<br>RSA
%K 模幂运算
%K SMM
%K 算法
%K 固定基窗口方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=57319E4289F4438F7A2F7AC51EED899D&yid=FF7AA908D58E97FA&vid=340AC2BF8E7AB4FD&iid=38B194292C032A66&sid=DC06EBDBAF4E06D3&eid=8243B77967FFD12E&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=14