RSA算法的一种简单快速变异算法

A fast variant algorithm of RSA

介绍了标准RSA算法,在此基础上提出了一种新的RSA算法的变异算法,新算法通过修改RSA算法中的模N=pq的结构为N=pqr,使用较小的素数来实现;实验证明,此算法的解密速度比标准算法的速度提高1.7倍,而且其加密强度和安全性不受影响.

A new variant of RSA algorithm is presented,in which N=pq change to N=pqr.Its performance and security are analysed.Both theoretical analysis and experiments show that a speedup could be obtained by a factor of 1.7 times over standard RSA.