计算机工程 ›› 2012, Vol. 38 ›› Issue (22): 119-121.doi: 10.3969/j.issn.1000-3428.2012.22.029

• 安全技术 • 上一篇    下一篇

辫群上的扭结共轭搜索问题和密码体制研究

程玉芳,王晓峰   

  1. (深圳大学数学与计算科学学院,广东 深圳 518000)
  • 收稿日期:2012-01-15 修回日期:2012-03-15 出版日期:2012-11-20 发布日期:2012-11-17
  • 作者简介:程玉芳(1985-),女,硕士研究生,主研方向:密码学;王晓峰,教授
  • 基金项目:

    国家自然科学基金资助项目(11071150);深圳市基础研究基金资助项目(JC201005280508A)

Research on Twisted Conjugacy Search Problem and Cryptosystems on Braid Group

CHENG Yu-fang, WANG Xiao-feng   

  1. (College of Mathematics and Computational Science, Shenzhen University, Shenzhen 518000, China)
  • Received:2012-01-15 Revised:2012-03-15 Online:2012-11-20 Published:2012-11-17

摘要: 通过分析辫群的相关性质及群上的判定问题,结合扭结共轭问题、子群成员判断问题及根搜索问题,提出一种辫群上的公钥加密协议和签名协议,对两者的安全性进行分析,证明敌手无法从公钥中恢复密钥,因此协议可以抵抗长度攻击、惟密钥攻击、一般选择消息攻击、定向选择消息攻击和适应性选择消息攻击。

关键词: 辫群, 扭结共轭搜索问题, 公钥密码体制, 根搜索问题, 子群成员判断问题, 数字签名协议

Abstract: By analyzing the properties of braid group and some decision problems on braid group, this paper proposes a protocol by applying twisted conjugacy 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.

Key words: braid group, twisted conjugacy search problem, public key cryptosystem, root search problem, subgroup membership decision problem, digital signature protocol

中图分类号: