braid groups

基本解釋

The present paper covers some irreducible representations of braid groups obtained by the Yang diagram method.
本文應(yīng)用辮子群表示的楊圖理論，計(jì)算給出了辮子群的部分不可約表示。
Analysis shows that two proxy signature schemes based on braid groups are insecure: the first scheme cannot resist the original signer's change attack;
對(duì)兩個(gè)基于辮群的代理簽名方案進(jìn)行了分析，發(fā)現(xiàn)它們并不滿(mǎn)足不可偽造性。
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.
辮群是一種非交換的無(wú)限群，該群中有許多困難問(wèn)題是不可解的，如字問(wèn)題、共軛問(wèn)題和根問(wèn)題等，利用這些困難問(wèn)題可以去設(shè)計(jì)一些密碼協(xié)議。

辮群
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.
本文,我們首次提出基于辮群上的難題(共軛問(wèn)題,多共軛問(wèn)題,辮分解問(wèn)題,求根問(wèn)題等)的代理簽名方案,并對(duì)其安全性進(jìn)行了分析。
電子、通信與自動(dòng)控制技術(shù)
辮群
Because of the non-commutativity property,the braid groups with braid index more than two become a new candidate for constructing cryptographic protocols.
辮指數(shù)大于2的辮群具有非交換性,因此成為了構(gòu)造密碼協(xié)議的新平臺(tái)。