The Root Extraction Problem in Braid Group-Based Cryptography

Abstract

AbstractThe root extraction problem in braid groups is the following: given a braid $$\beta \in \mathcal {B}_n$$ β ∈ B n and a number $$k\in \mathbb {N}$$ k ∈ N , find $$\alpha \in \mathcal {B}_n$$ α ∈ B n such that $$\alpha ^k=\beta $$ α k = β . 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.