基于辫群的识别协议

An Identification Protocol Based on Braid Group

辫群是一种非交换的无限群,该群中有许多困难问题是不可解的,如字问题、共轭问题和根问题等,利用这些困难问题可以去设计一些密码协议。文中基于辫群上的共轭问题和共轭查找问题提出了一种识别协议,同时分析了协议的特性。

The braid groups are infinite non - commutative group, The braid groups have many hard problems that can be utilized to design cryptographic primitives, for example, the word problem, conjugacy problem, and root problem. This paper proposes an identification protocol using the conjugacy problem and conjugacy search problem in the braid groups. The performance of this protocol are also discussed.