论文部分内容阅读
分析了基于Diffie—Hellman和RSA的密钥交换所面临的威胁。给出了生成DH安全素数和RSA安全素数的若干支持理论,由此可证明在算术级数上可得到形如P=2q+1的安全素数。最后,给出了上述密钥交换协议在安全套接字层和IP层的应用。
The threats to key exchange based on Diffie-Hellman and RSA are analyzed. A number of support theories for generating DH primes and RSA primes are given, from which it can be shown that there are available safe primes with the form P = 2q + 1 on the arithmetic progression. Finally, the application of the above key exchange protocol in Secure Sockets Layer and IP Layer is given.