The Root Extraction Problem for Generic Braids
We show that, generically, finding the k-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid x on n strands and canonical length l, and an integer k > 1, computes a k-th root of x, if it exists, or guarantees that such a root does not exist. The gener...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universidad de Huelva (UHU) |
| Repositorio: | Arias Montano. Repositorio Institucional de la Universidad de Huelva |
| Idioma: | inglés |
| OAI Identifier: | oai:ariasmontano.uhu.es:10272/17584 |
| Acceso en línea: | http://hdl.handle.net/10272/17584 |
| Access Level: | acceso abierto |
| Palabra clave: | Braid groups Algorithms in groups Group-based cryptography |
| Sumario: | We show that, generically, finding the k-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid x on n strands and canonical length l, and an integer k > 1, computes a k-th root of x, if it exists, or guarantees that such a root does not exist. The generic-case complexity of this algorithm is O(l(l + n)n3 log n). The non-generic cases are treated using a previously known algorithm by Sang-Jin Lee. This algorithm uses the fact that the ultra summit set of a braid is, generically, very small and symmetric (through conjugation by the Garside element D), consisting of either a single orbit conjugated to itself by D or two orbits conjugated to each other by D. |
|---|