Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups

DOI10.1080/00927872.2015.1065867MaRDI QIDQ5740571zbMATH OpenOpenAlexFDO

Authors Xiaofeng Wang, Guo Li, Ling Yang, Hanling Lin

Publication date 27 July 2016

Published in Communications in Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00927872.2015.1065867

zbMATH Keywords

braid groupunsolvable word problemMihailova subgroupunsolvable subgroup membership problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• scientific article; zbMATH DE number 1759777
• Braid Group Cryptography
• Combinatorial group theory and public key cryptography
• Public Key Cryptography - PKC 2006
• Towards generating secure keys for braid cryptography

Cites work

• scientific article; zbMATH DE number 1617914 (Why is no real title available?)
• scientific article; zbMATH DE number 67424 (Why is no real title available?)
• scientific article; zbMATH DE number 1950342 (Why is no real title available?)
• scientific article; zbMATH DE number 2009975 (Why is no real title available?)
• scientific article; zbMATH DE number 2081063 (Why is no real title available?)
• scientific article; zbMATH DE number 1759777 (Why is no real title available?)
• scientific article; zbMATH DE number 2086696 (Why is no real title available?)
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• A new approach to the conjugacy problem in Garside groups.
• A recursive presentation for Mihailova's subgroup.
• Advances in Cryptology - CRYPTO 2003
• An algebraic method for public-key cryptography
• Aspherical group presentations
• Combinatorial group theory and public key cryptography
• Conjugacy problem for braid groups and Garside groups.
• Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
• Cryptanalysis of the shifted conjugacy authentication protocol
• Embedding Theorems for Groups
• Entity authentication schemes using braid word reduction
• Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
• Non-Abelian key agreement protocols
• On Some Groups which cannot be Finitely Presented
• Probabilistic solutions of equations in the braid group.
• Relations among the squares of the generators of the braid group
• Representation attacks on the Braid Diffie-Hellman public key encryption
• Simple examples of groups with unsolvable word problem
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• The word problem
• Using shifted conjugacy in braid-based cryptography

Cited in

(1)

• Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility

Describes a project that uses

Uses Software

• CBraid

This page was built for publication: Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740571)