Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups
Juan Gonzalez-Meneses
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.
Create a lesson
Related papers
Combinatorial Goussarov-Polyak-Viro Formulas for the Linking Number and Low Degree Coefficients of the Conway Polynomial
Nancy Scherich, Nathaniel Song
The flip symmetry on Khovanov-Rozansky homology
Hongjian Yang
Families of knots that cannot be made Legendrian parametrically
Javier Martínez-Aguinaga
Branched real projective structures on surfaces and geometrisation of representations
Gianluca Faraco, Nicholas Rungi
Generating the twist subgroup of the level 2 mapping class group of a non-orientable closed surface
Ryoma Kobayashi
H-cobordisms, infinite cyclic covers, and real Seiberg--Witten theory
Sungkyung Kang, JungHwan Park, Masaki Taniguchi