The root extraction problem in braid group-based cryptography

Authors María Cumplido, Delaram Kahrobaei, Marialaura Noce

Publication date 29 March 2022

Braid groups; Artin groups (20F36) Authentication, digital signatures and secret sharing (94A62)

Abstract: The root extraction problem in braid groups is the following: given a braid

and a number

k i n m a t h b b N

, find

a l p h a i n m a t h c a l B_{n}

such that

. 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.

This page was built for publication: The root extraction problem in braid group-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6395087)