摘要
为构造抗量子攻击的密码协议,以非交换的辫群为平台,基于求根问题的难解性提出了一个非平衡比特承诺协议。分析表明,协议具有绑定性和隐藏性,且协议执行过程不涉及共轭判断运算,在计算上比基于共轭搜索问题的比特承诺协议更有效。
In order to construct quantum attack-resistant cryptographic protocols, non-commutative braid group is used as a new platform. This paper proposed a biased bit commitment protocol on base of the difficulty of root extraction problem over braid groups. Analysis shows that the proposed protocol is binding and hiding. And it is much more efficient in computation than the protocol based on since it needs no conjugacy decision operation.
出处
《计算机应用研究》
CSCD
北大核心
2012年第3期1076-1077,1083,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(10501053)
关键词
辫群
比特承诺
求根问题
共轭搜索问题
braid group
bit commitment
root extraction problem(REP)
conjugacy search problem(CSP)