摘要
RSA公钥密码算法的基础是欧拉定理,它的安全性依赖于大素数因式分解的困难性。RSA算法通常是先生成一对密钥。文章对生成密钥过程中所需参数进行分析和讨论,并结合实例对RSA公钥密码算法进行了实现。
RSA Public Cryptogram algorithm is based on Theorem of Euler, whose security depends on the difficulty about the factor decomposed of great number. The algorithm usually firstly generates a pair of right keys. The paper analyzes and discusses the process about it, and combines the instance to implement RSA algorithm.
出处
《忻州师范学院学报》
2006年第2期47-50,共4页
Journal of Xinzhou Teachers University
关键词
公钥密码
RSA算法
欧拉定理
Common key cryptography
RSA algorithm
Theorem of Euler
