braid groups

基本解释

The present paper covers some irreducible representations of braid groups obtained by the Yang diagram method.
本文应用辫子群表示的杨图理论，计算给出了辫子群的部分不可约表示。
Analysis shows that two proxy signature schemes based on braid groups are insecure: the first scheme cannot resist the original signer's change attack;
对两个基于辫群的代理签名方案进行了分析，发现它们并不满足不可伪造性。
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.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。

辫群
In this paper, we propose the first proxy signature scheme based on the conjugacy problem, multiple simultaneous conjugacy problem, and root problem, which are belived to be hard problems in braid groups, and anlyze the the security of the scheme.
本文,我们首次提出基于辫群上的难题(共轭问题,多共轭问题,辫分解问题,求根问题等)的代理签名方案,并对其安全性进行了分析。
电子、通信与自动控制技术
辫群
Because of the non-commutativity property,the braid groups with braid index more than two become a new candidate for constructing cryptographic protocols.
辫指数大于2的辫群具有非交换性,因此成为了构造密码协议的新平台。