基于辫群的密钥交换协议算法的分析与实现

Analysis and Implementation of Key Exchange Protocol Based on Braid Groups

辫群中某些特定的字问题和共轭问题是不可解的,鉴于这种特性,利用辫群的思想可以构造出在电子商务中实现数据加密的算法。密钥交换协议能够在两人或多人之间通过一个协议取得密钥并用于进一步的数据加密,在实际的密码世界中密钥交换是很重要的一个环节。文中分析了基于辫群的Anshel-Anshel-Goldfeld密钥交换协议算法的实现过程和安全性。基于辫群的密钥交换协议,能够很好地解决数据加密中密钥在发送者和接收者之间的交付难题,必将会有广阔的应用前景。

Some particular word problems and conjugacy problems in braid group are unsolvable. Herein this characteristic can make use of the braid group to construct the algorithm in order to achieve data encryption in electronic commerce. Key exchange protocol enables two or more people get a key through a protocol that can be used in further data encryption. In the real world of cryptogram the key exchange plays a very important role. The implementation of the Anshel-Anshel-Goldfeld key exchange protocol and its security are emphasized here. Since the key exchange protocol can ensure the safety of the delivery between the sender and the receiver in data encryption, it will open up a vast range of prospects in the cryptography field.