素数测试在RSA公开密钥密码算法中的分析研究

Prime Number Test and Its Analysis In the RSA Public-key Cipher Algorithm

论述了 RSA公开密钥密码技术及 RSA安全性分析 ,介绍了 Solovay-Strassen素数测试算法以及 Miller-Rabin素数测试算法 ,进一步论述了产生充分大的素数是切实可行的 .

This paper discussed carefully RSA public key cipher technology,RSA security analysis and presented Solovay strassen and Miller rabin prime number test algorithm.The conclusion suggested that it was feasible to produce enough large prime number.