摘要
密钥协商是密钥管理中的重要研究课题之一 .文中基于 Abel有限群上离散对数问题的求解困难性 ,通过引入可信第三方权威认证机构 ,提出并实现了一种简单实用的高效密钥协商方案XKAS.该方案无需繁琐的身份鉴别认证过程 ,也不需要引入时戳服务器 ,能够抵抗目前已知的各种攻击方案 ,安全性很高 .与之前的各种类似的密钥协商方案相比 ,XKAS方案操作简单、高效 ,能够应用于各种软硬件环境中 .
Key agreement is one of the core problems in the key mangement. In this paper, a new key agreement scheme named Xiao's key agreement scheme (XKAS) is introduced. The XKAS scheme is put forward based on the difficulty in sloving the discrete logarithm problem in the Abel finite group, with the help of the dependably certificate authority institution. No any additional operations such as Identify, Provable and Authentication are needed. No time server is needed too. Compared with the other key agreement schemes, the XKAS scheme is simple, high-efficiency and security, and can be applied in many domain.
出处
《武汉理工大学学报（交通科学与工程版）》
北大核心
2003年第6期758-761,共4页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
基金
国家自然科学基金资助 (批准号 :60 172 0 3 5
90 3 0 40 18)
湖北省自然科学基金项目资助 (批准号 :2 0 0 0 J15 4)
关键词
密钥协商
离散对数问题
安全协议
key agreement
discrete logarithm problem
security protocol
