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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages

Keywords

Geometric Topology, Group Theory, 20F36; 20F10; 94A60

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/65952

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0212150
 http://arxiv.org/abs/math/0212150

Collections

arXiv