摘要
通过分析辫群的相关性质及群上的判定问题,结合扭结共轭问题、子群成员判断问题及根搜索问题,提出一种辫群上的公钥加密协议和签名协议,对两者的安全性进行分析,证明敌手无法从公钥中恢复密钥,因此协议可以抵抗长度攻击、惟密钥攻击、一般选择消息攻击、定向选择消息攻击和适应性选择消息攻击。
By analyzing the properties of braid group and some decision problems on braid group, this paper proposes a protocol by applying twisted eonjugacy search problem, subgroup membership decision problem and root search problem on to specific subgroups of braid groups where the subgroups enjoy unsolvable word problem. Security analysis shows that the protocol can resist length attack, key-only attack, chosen message attack and chosenplaintext attack and so on.
出处
《计算机工程》
CAS
CSCD
2012年第22期119-121,125,共4页
Computer Engineering
基金
国家自然科学基金资助项目(11071150)
深圳市基础研究基金资助项目(JC201005280508A)
关键词
辫群
扭结共轭搜索问题
公钥密码体制
根搜索问题
子群成员判断问题
数字签名协议
braid group
twisted conjugacy search problem
public key cryptosystem
root search problem
subgroup membership decision problem
digital signature protocol
