GROUPS WITH TWO GENERATORS HAVING UNSOLVABLE WORD PROBLEM AND PRESENTATIONS OF MIHAILOVA SUBGROUPS OF BRAID GROUPS

COMMUNICATIONS IN ALGEBRA(2016)

引用 2|浏览11
暂无评分
摘要
A presentation of a group with two generators having unsolvable word problem and an explicit countable presentation of Mihailova subgroup of F-2 x F-2 with finite number of generators are given, where the Mihailova subgroup of F-2 x F-2 enjoys the unsolvable subgroup membership problem. Particularly, a braid group B-n with n >= 6 then contains Mihailova subgroups, and therefore, one possibly can apply the generators of these subgroups to create entities' private keys in a public key cryptsystem by taking a braid group as the correspondent platform.
更多
查看译文
关键词
PUBLIC-KEY CRYPTOGRAPHY,CONJUGACY PROBLEM,AGREEMENT PROTOCOLS,PRACTICAL ATTACK,SEARCH PROBLEM,GARSIDE GROUPS,CRYPTANALYSIS,CRYPTOSYSTEM
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要