RSA算法的一种高效软件实现方法

An Efficient Implentation Of Rsa Algorithm

分析了RSA算法的软件实现难点为大数的幂模运算,提出了将大数的幂模运算转换为小数幂模运算乘积的高效方法,并实现了RSA算法,该方法在理论分析和试验方面都具有较好的效果。

The algorithm RSA is complicated and difficult in implementing, because it has to do modular exponentiation on large numbers more than 512 bits. In this paper, a new implementation of RSA is presented. This implementation transforms modular exponentiation on large numbers into the product of modular exponentiation on little numbers. It is shown by theoretical analyzing and real application that the proposed method is very efficient.