远程用户基于ECDLP的快速认证密钥协商方案

针对无线通信中用户进行身份认证与密钥协商存在的安全性与计算量之间的制约关系问题,提出一种基于椭圆曲线离散对数难题(Elliptic Curve Discrete Logarithm Problem,ECDLP)的用户快速认证密钥协商协议。该协议通过对用户注册与认证密钥协商阶段的安全性与计算量进行综合分析,基于ECDLP难题为用户在注册阶段分配唯一身份标识符,通过增加用户注册阶段服务器的计算量,有效降低认证密钥协商阶段的计算量,在保证通信机密性、认证性与完整性的条件下,提高用户进行认证密钥协商的效率。安全性分析与计算量对比的结果表明,与其他同类协议相比,本文所提出的协议能在满足安全需求的前提下,有效地降低认证密钥协商协议的总体计算量。 

Research on Remote User Fast Authentication Key Exchange Scheme Based on ECDLP

Aiming at the problem of security issues and computational cost in wireless communication while the authenticated key exchange is executing. A remote user fast authenticated key exchange protocol based on Elliptic Curve Discrete Logarithm Problem (ECDLP) is proposed. Upon the comprehensive analysis of security and computational cost between user registration and key exchange phase, the user’s unique identifier was assigned based on ECDLP. The computational complexity of authenticated key exchange phase was reduced accordingly with the increasing of computation cost of server in the user registration phase. The computational efficiency of authenticated key exchange is improved under the situation of confidentiality, authentication and integrity is guaranteed. The security analysis and computation comparison with the others related protocols was implemented. The results suggest that the overall computational complexity of the proposed protocol can be effectively reduced under the premise of satisfying the security requirements.