Abstract: The performance of RSA decryption has direct relationship with the efficiency of modular exponentiation implementation. The authors proposed a variant of RSA cryptosystem by transferring some decryption computations to encryption and multi-prime principle to reduce modules and private exponents in modular exponentiation. The experimental results show that the decryption speed and security level of RSA have been substantially improved. The variant can be efficiently implemented in parallel and the parallel implementation of the variant on multi-core devices can further improve the overall performance of RSA system.

Key words: Rivest-Smir-Adleman (RSA) algorithm, modular exponentiation, acceleration, parallel, multi-core

摘要： RSA算法的解密性能与大数模幂运算的实现效率有着直接的关系。提出一种RSA算法的改进方案，通过将RSA解密时的一些运算量转移到加密方，并且运用多素数原理使得解密时大数模幂运算的模位数和指数位数减小。实验结果表明该方案不仅提高了RSA密码系统的安全性，而且提升了RSA密码系统解密的性能，且该方案易于并行实现，可使得基于多核平台的RSA系统的性能得到进一步提升。

关键词: RSA算法, 模幂, 加速, 并行, 多核