中文摘要：

RSA算法是基于数论的公钥密码体制，是公钥密码体制中最优秀的加密算法．由于RSA算法中大安全素数必须在512bit以上，因此，RSA算法的寻找安全素数实现难度大，运算时间长．根据素数的陈氏表示法改进RSA公钥密码体制中的安全素数寻找方法，以提高RSA算法的运行速度．

英文摘要：

The RSA algorithm based on the numeric theory is the best encryption algorithm in public_key cryptosystems. It is much complicated and difficult in calculatiog safety prime number, because it has to calculate the big safety prime number with more than 1024bit. According to Chen＇s prime number representation method, this paper improves the method of calculating safety prime number to increase the speed of the RSA.