期刊文献+

基于非交换代数结构的公钥密码体制

NEW Public Key Cryptosystem Using Non-Abelian Algebra Structures
下载PDF
导出
摘要 提出了一个新的基于非交换代数结构的Diffie-Hellman密钥交换协议,并在此基础上建立了一个新的公钥密码体制.它的安全性取决于一个基本问题的困难性,而这个基本问题是共轭搜索问题和Diffie-Hellman问题的结合变形问题.最后将提出的体制应用到数字签名方案中,并给出一个类似于ElGamal的签名方案. Propose a new Diffie-Hellman key exchange scheme based on non-Abelian algebra structures and also propose a new public key cryptosystem based on the proposed scheme. The security of this scheme relies on the difficulty of a base problem, which combines the conjugacy search problem with the Diffie-Hellman,problem, and which is a transformation problem. At last, apply the proposed cryptosystem to a signature scheme which is similar to ElGamal scheme.
出处 《河南教育学院学报(自然科学版)》 2011年第3期35-36,共2页 Journal of Henan Institute of Education(Natural Science Edition)
基金 国家自然科学基金资助项目(11071081) 浙江省自然科学基金杰出青年团队项目(R1090138)
关键词 非交换代数结构 Diffie—Hellman密钥交换协议 扭共轭搜索问题 公钥密码体制 non-Abelian algebra structure Diffie-Hellman key exchange scheme twisted conjugacy search problem public key cryptosystem
  • 相关文献

参考文献7

  • 1KO K H, LEE S J, CHEON J H. New public key cryptosystem using braid groups[J]. Lecture Notes in Computer Science, 2000, 30(1880) : 166 - 183.
  • 2PAENG S H, HA K C, KIM J H, et al. New public key cryptosystem using finite non Abelian groups[J]. Lecture Notes in Computer Science, 2001, 31 (2139) : 470 -485.
  • 3SHPILRAIN V, USHAKOV A. An authentication scheme based on the twisted conjugacy problem [ J]. Lecture Notes in Computer Science, 2008, 38 ( 5037 ) : 366 - 372.
  • 4GARBER D, KAPLAN S, TEICHER M, et al. Probabilistic solutions of equations in the Braid group[ J ]. Advances in Applied Mathematics, 2005, 35(3) : 323 -334.
  • 5GARBER D, KAPLAN S, TEICHER M, et al. Length-based conjugacy search in the Braid group[ J]. Contemp Math Amer Math Soc, 2006, 54 (418) : 75 -87.
  • 6MYASNIKOV A D, USHAKOV A. Length based attack in braid groups[ J]. Lecture Notes in Computer Science, 2007, 37 (4450) : 76 -88.
  • 7RUINSKIY D, SHAMIR A, TSABAN B. Cryptanalysis of group-based key agreement protocols using subgroup distance functions[ J]. Lecture Notes in Computer Science, 2007, 37 (4450): 61 -75.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部