Welcome to the resource topic for 2005/264
Title:
On an authentication scheme based on the Root Problem in the braid group
Authors: Boaz Tsaban
Abstract:Lal and Chaturvedi proposed two authentication sche-mes presumably
based on the difficulty of the Root Problem in the braid group.
We describe a deterministic linear time algorithm to crack
the first scheme, and show that
the second scheme is not more secure than schemes based on the
Conjugacy Search Problem, and can therefore be cracked by existing
heuristic attacks with very good success probability, as long as
the parameters are practical.
ePrint: https://eprint.iacr.org/2005/264
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .