Large number modular power multiplication algorithm based on RSA cryptosystem

Zhang Bing-ru · Journal of Qinghai University · 2007

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

Read the paper · More papers on PaperTik