BatchRSA算法的解密性能与其指数计算阶段的大数模幂运算的实现效率有着直接的关系。提出了一种BatchRSA算法的改进方案,通过将BatchRSA算法解密时指数计算阶段的一些运算量转移到加密方,运用多素数技术使大数模幂运算的模位数和指数位数减小来加速BatchRSA的解密过程。理论分析和实验数据表明该改进算法使得BatchRSA算法的解密性能得到明显提升。
The performance of Batch RSA decryption has direct relationship with the efficiency of the full sized modular ex- ponentiation implementation in the exponentiation phase.This paper proposes a variant of Batch RSA algorithm by transfer- ring 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.