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.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
This paper studies problem of the average length of conjugacy classes of finite groups.
摘要本文研究有限群元素共轭类的平均长度问题。
This paper studies problem of the average length of conjugacy classes of finite groups.
本文研究有限群元素共轭类的平均长度问题。
This paper studies problem of the average length of conjugacy classes of finite groups.
本文研究有限群元素共轭类的平均长度问题。
应用推荐