基于RSA体制的大数模幂乘算法

Large number modular power multiplication algorithm based on RSA cryptosystem

通过对RSA体制的描述,分析了在该体制中应用的y=xe(modn)的求解方法,利用中国剩余定理,改进了求解y=xe(modn)的过程,特别适合软件实现。

The method for the y = x^e（mod n）solution used in the cryptosystem is analyzed in this paper the RSA system description and then the process of y = x^e （mod n） solution is improved to using China remaider theorem and this is very suitable to software realization.