计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (29): 107-109.

• 网络、通信、安全 • 上一篇    下一篇

改进的Batch RSA算法的设计与实现

李云飞1,2,柳 青2,郝 林3,刘庆龙3   

  1. 1.云南空管分局 技术保障部,昆明 650200
    2.云南大学 软件学院,昆明 650091
    3.云南大学 信息学院,昆明 650091
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-10-11 发布日期:2011-10-11

Design and implementation of improved Batch RSA algorithm

LI Yunfei1,2,LIU Qing2,HAO Lin3,LIU Qinglong3   

  1. 1.Technical Support Department,Yunnan Air Traffic Management Sub-Bureau-CAAC,Kunming 650200,China
    2.School of Software,Yunnan University,Kunming 650091,China
    3.School of Information Science and Engineering,Yunnan University,Kunming 650091,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-10-11 Published:2011-10-11

摘要: Batch RSA算法的解密性能与其指数计算阶段的大数模幂运算的实现效率有着直接的关系。提出了一种Batch RSA算法的改进方案,通过将Batch RSA算法解密时指数计算阶段的一些运算量转移到加密方,运用多素数技术使大数模幂运算的模位数和指数位数减小来加速Batch RSA的解密过程。理论分析和实验数据表明该改进算法使得Batch RSA算法的解密性能得到明显提升。

关键词: Batch RSA, 加速, 解密, 模幂

Abstract: The performance of Batch RSA decryption has direct relationship with the efficiency of the full sized modular exponentiation implementation in the exponentiation phase.This paper proposes a variant of Batch RSA algorithm by transferring some decryption computations to encryption and using multi-prime technology to reduce modules and private exponents in modular exponentiation.The experimental results and the theoretical values show that the speed of the decryption has been substantially improved.

Key words: Batch RSA, acceleration, decryption, modular exponentiation