关于基于编子群根问题的身份验证方案
密码学与安全
2010-11-02 v3
摘要
Lal 和 Chaturvedi 提出了两个基于编子群根问题难度的身份验证方案。我们指出第一个方案并不像根问题那样安全，描述了一种高效破解方法。该攻击适用于任何群。
引用
@article{arxiv.cs/0509059,
title = {On an authentication scheme based on the Root Problem in the braid group},
author = {Boaz Tsaban},
journal= {arXiv preprint arXiv:cs/0509059},
year = {2010}
}
备注
This paper has been withdrawn by the author. One of the claims is incorrect as written. We are working on correcting and generalizing it. This will be published in another paper