Repositorio de producción científica de la Universidad de Sevilla

Improving an algorithm to solve multiple simultaneous conjugacy problems in braid groups

Opened Access Improving an algorithm to solve multiple simultaneous conjugacy problems in braid groups

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: González-Meneses López, Juan
Departamento: Universidad de Sevilla. Departamento de álgebra
Fecha: 2005
Publicado en: Contemporary Mathematics, 372, 35-42.
Tipo de documento: Artículo
Resumen: 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.
Cita: González-Meneses López, J. (2005). Improving an algorithm to solve multiple simultaneous conjugacy problems in braid groups. Contemporary Mathematics, 372, 35-42.
Tamaño: 154.8Kb
Formato: PDF

URI: http://hdl.handle.net/11441/43117

DOI: 10.1090/conm/372/06872

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones