Paper 2005/264 Original: eprint.iacr.org/2005/264 ↗
On an authentication scheme based on the Root Problem in the braid group
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2009-05-10: last updated
- 2005-08-11: published
- Short URL
- https://ia.cr/2005/264
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/264,
author = {Boaz Tsaban},
title = {On an authentication scheme based on the Root Problem in the braid group},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/264},
year = {2005},
url = {https://eprint.iacr.org/2005/264}
}