The root extraction problem in braid group-based cryptography
The root extraction problem in braid groups is the following: given a braid and a number , find such that . In the last decades, several cryptosystems based on the root extraction problem, including authentication schemes and digital signatures, have been proposed. In this survey paper, we describe...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/177715 |
| Acceso en línea: | https://hdl.handle.net/11441/177715 https://doi.org/10.1007/s44007-024-00117-x |
| Access Level: | acceso abierto |
| Palabra clave: | Braid groups Algorithmic problems Root problem Cryptography |
| Sumario: | The root extraction problem in braid groups is the following: given a braid and a number , find such that . In the last decades, several cryptosystems based on the root extraction problem, including authentication schemes and digital signatures, have been proposed. In this survey paper, we describe these cryptosystems built around braid groups. Then we explain that, in general, these authentication schemes and digital signatures are not secure, and we present for each of them a possible attack. |
|---|