Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups
classification
🧮 math.GT
math.GR
keywords
braidconjugacygroupsproblemssolvealgorithmmultiplesimultaneous
read the original abstract
There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by the author and Nuno Franco, originally intended to solve the Conjugacy Search Problem in braid groups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.