计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (28): 65-66.DOI: 10.3778/j.issn.1002-8331.2008.28.023

• 理论研究 • 上一篇    下一篇

秦九韶算法思想在RSA密码算法中的应用研究

董付国1,厉玉蓉1,2   

  1. 1.山东工商学院 信息与电子工程学院,山东 烟台 264005
    2.山东大学 计算机科学与技术学院,济南 250100
  • 收稿日期:2007-11-19 修回日期:2008-02-01 出版日期:2008-10-01 发布日期:2008-10-01
  • 通讯作者: 董付国

Study on QinJiuShao algorithm and its application in RSA

DONG Fu-guo1,LI Yu-rong1,2   

  1. 1.School of Information and Electronics Engineering,Shandong Institute of Business and Technology,Yantai,Shandong 264005,China
    2.School of Computer Science and Technology,Shandong University,Jinan 250100,China
  • Received:2007-11-19 Revised:2008-02-01 Online:2008-10-01 Published:2008-10-01
  • Contact: DONG Fu-guo

摘要: 介绍了用于快速计算高次多项式值的“秦九韶算法”,并用类似思路分析了RSA算法中方幂模快速实现算法,最后给出了该算法的具体实现。算法分析和实验结果证明,该算法的计算量不会随着指数的快速增大而增大,通过精心选择指数,还可以减少运算量。RSA算法中明文分组和密文分组都较大,方幂模运算消耗大量的运算时间。因此,简化方幂模计算减少计算次数对设计RSA快速算法和选择密钥具有重要的指导意义。

关键词: 秦九韶算法, RSA, 快速算法, 方幂模

Abstract: 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.

Key words: QinJiuShao algorithm, RSA, fast algorithm, modular exponentiation