Mean-set attack: cryptanalysis of Sibert et al. authentication protocol

Journal of mathematical cryptology

article

Natalia Mosina¹  Alexander Ushakov² 

[1] The City University of New York (LAGCC);Department of Mathematics, Stevens Institute of Technology

关键词: Group-based cryptography;    zero knowledge;    authentication protocol;    probability on graphs and groups;    braid group;    mean-set;    mean-set attack principle;    shift search problem;   

DOI  :  10.1515/jmc.2010.006

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

We analyze the Sibert et al. group-based (Feige–Fiat–Shamir type) authentication protocol and show that the protocol is not computationally zero-knowledge. In addition, we provide experimental evidence that our approach is practical and can succeed even for groups with no efficiently computable length function such as braid groups. The novelty of this work is that we are not attacking the protocol by trying to solve an underlying complex algebraic problem, namely, the conjugacy search problem, but use a probabilistic approach, instead.

【 授权许可】

CC BY|CC BY-NC-ND