Study on QinJiuShao algorithm and its application in RSA
Yurong Li · Computer Engineering and Applications Journal · 2008
This paper studies QinJiuShao algorithm for fast computation of high-rank polynomial,analyses fast algorithm of modular exponentiation in RSA,and gives its implementation.Analysis and experiment results show that computation quantity of this algorithm does not get too larger with exponentiation getting larger very fast,and may reduce when exponentiation well-selected.Computation of modular exponentiation is very low because of big plain-text group and cipher-text group,so this algorithm is of great significance to design fast algorithm of RSA and select public-key and private-key of RSA.