On an authentication scheme based on the Root Problem in the braid group
classification
💻 cs.CR
keywords
groupproblemrootauthenticationbraidschemeattackchaturvedi
read the original abstract
Lal and Chaturvedi proposed two authentication schemes based on the difficulty of the Root Problem in the braid group. We point out that the first scheme is not really as secure as the Root Problem, and describe an efficient way to crack it. The attack works for any group.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.