期刊文献+

基于口令认证的密钥协商协议研究 被引量:1

Research on key agreement protocol based on password authentication
下载PDF
导出
摘要 通过构建密钥协商协议为公开网络通信提供安全的会话密钥,保障通信安全。针对当前密钥协商协议抗攻击性能不好、公钥密码体制不安全的问题,提出基于口令认证的密钥协商协议设计方法。首先基于网络部署构建密钥预分配方案,采用Logistics混沌映射构建公钥加密方案;然后根据口令认证分组加密技术构建混合安全的密钥协商协议;最后通过仿真实验进行性能测试。实验结果表明,采用设计的密钥协商协议能提高密文的抗攻击能力,该方案的安全性得到证明。 The key agreement protocol was constructed to provide a secure session key for the public network communica?tion,and guarantee the communication security. Since the current key agreement protocol has poor anti?attack performance and unsafe public key cryptosystem,the design method of the key agreement protocol based on password authentication is proposed.The key pre?distribution scheme was built based on the network deployment. The Logistics chaotic mapping is used to construct the public key encryption scheme. The key agreement protocol of the mixed security was constructed according to the password authentication grouping encryption technology. The performance of the protocol was tested with simulation experiment. The experi?mental results show that the key agreement protocol can improve the performance against the cipher text attack,and its securitywas proved.
作者 李芳 LI Fang(Zhongguancun Institute,Beijing 100083,China)
机构地区 中关村学院
出处 《现代电子技术》 北大核心 2017年第3期71-74,共4页 Modern Electronics Technique
关键词 口令认证 密钥协商协议 混沌映射 密文攻击 password authentication key agreement protocol chaotic mapping cipher text attack
  • 相关文献

参考文献6

二级参考文献44

  • 1Rivest R L, Adleman L, Dertouzos M L.On data banks and privacy homomorphisms[Z].Foundations of Secure Computation, 1978.
  • 2Gentry C.Fully homomorphic encryption using ideal lattices[C]//STOC' 09,2009 : 169-178.
  • 3Gentry C.A fully homomorphic encryption scheme[D/OL]. Stanford University , 2009.http : //crypto.stanford.edu/craig.
  • 4van Dijk M, Gentry C, Halevi S, et al.Fully homomorphic encryption over the integers[C]//Volume 6110 of LNCS : Proc of Eurocrypt, 2010 : 24-43.
  • 5Smart N P, Vercauteren F.Fully homomorphic encryption with relatively small key and ciphertext sizes[C]// Volume 6056 of Lecture Notes in Computer Science: Public Key Cryptography-PKC' 10, Springer, 2010.
  • 6Stehle D, Steinfeld R.Faster fully homomorphic encryption, Cryptology ePrint Archive, Report 2010/299[EB/OL]. (2010).http://eprint.iacr.org/.
  • 7Howgrave-Graham N.Approximate integer common divisors[C]//Volume 2146 of Lecture Notes in Computer Science: CaLC' 01.[S.l.] : Springer, 2001 : 51-66.
  • 8RIVEST R, SHAMIR A, ADLEMAN L. A method for obtaining di- gital signatures and public-key cryptosystems [ J ]. Communications of the ACM,1978,21 (2) :120-126.
  • 9RIVEST R, SHAMIR A, DERTOUZOS M, On data banks and pri-va- cy homomorphisms [ J ]. Foundations of Secure Computation, 1978,7 ( 1 ) : 169-177.
  • 10BONEH D, GENTRY. A fully homomorphic encryption scheme [ D ]. Stanford : Stanford University,2009.

共引文献120

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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