Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups

Simple item page
dc.creatorGonzalez-Meneses, Juan
dc.date2002-12-10
dc.date.accessioned2026-07-07T04:53:41Z
dc.date.available2026-07-07T04:53:41Z
dc.descriptionThere 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0212150
dc.identifierhttp://arxiv.org/abs/math/0212150
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65952
dc.subjectGeometric Topology
dc.subjectGroup Theory
dc.subject20F36; 20F10; 94A60
dc.titleImproving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups
dc.typetext

Files

Collections

arXiv