Consistency analysis of addition chains for several fast algorithms of modular exponentiation
Yurong Li · Computer Engineering and Applications Journal · 2010
Modular exponentiation is the most frequently used and time-cost part in RSA,whose fast algorithm is one of the focuses of RSA study,and to speed up the computation of modular exponentiation is most important to the performance and wide use of RSA.This paper studies Qin Jiu-shao algorithm,blocking algorithma,ddition chains algorithma,nd adaptive bi-nary partition table searching method.Another contribution of this paper is that the above algorithms are analyzed from the point of view of addition chains.In the point of view of addition chainst,hey are accordant,and adaptive binary partition ta-ble searching method can get higher efficiency than Qin Jiu-shao algorithm and blocking algorithm,but may be further improved.