The root extraction problem in braid group-based cryptography

The root extraction problem in braid groups is the following: given a braid $\beta \in \mathcal{B}_n$ and a number $k\in \mathbb{N}$, find $\alpha\in \mathcal{B}_n$ such that $\alpha^k=\beta$. In the last decades, many cryptosystems such as authentication schemes and digital signatures based on the root extraction problem have been proposed. In this paper, we first describe these cryptosystems built around braid groups. Then we prove that, in general, these authentication schemes and digital signature are not secure by presenting for each of them a possible attack.