Computer aided discovery of a fast algorithm for testing conjugacy in braid groups

DOI10.1007/978-3-540-37634-7_12zbMath1148.20025OpenAlexW112732963MaRDI QIDQ3517215

Volker Gebhardt

Publication date: 12 August 2008

Published in: Discovering Mathematics with Magma (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-37634-7_12

zbMATH Keywords

algorithmscomputationsArtin braid groupspublic key cryptosystemscryptographic protocolsconjugacy problemconjugacy search problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

This page was built for publication: Computer aided discovery of a fast algorithm for testing conjugacy in braid groups