As one of the important applications of Smart grid, charging between electric vehicles has attracted much attention. However, authentication between vehicle users and an aggregator may be vulnerable to various attacks due to the usage of wireless communications. In order to reduce the computational costs yet preserve required security, the Chebyshev chaotic map based authentication schemes are proposed. However, the security requirements of Chebyshev polynomials bring a new challenge to the design of authentication schemes based on Chebyshev chaotic maps. To solve this issue, we propose a practical Chebyshev polynomial algorithm by using a binary exponentiation algorithm based on square matrix to achieve secure and efficient Chebyshev polynomial computation. We further apply the proposed algorithm to construct an energy-efficient authentication and key agreement scheme for smart grid environments. Compared with state-of-the-art schemes, the proposed authentication scheme effectively reduces the computational costs and communication costs by adopting the proposed Chebyshev polynomial algorithm. Furthermore, the ProVerif tool is employed to analyze the security of the proposed authentication scheme. Our experimental results justified that our proposed authentication scheme can outperform state-of-the-art schemes in terms of the computational overhead while achieving privacy protection.
翻译:作为智能网格的重要应用之一,电动车辆之间的收费引起了人们的极大关注。然而,由于使用无线通信,车辆使用者和聚合器之间的认证可能易受各种攻击。为了降低计算成本,同时又维护必要的安全,提出了Chebyshev混乱地图的认证办法。然而,Chebyshev多元网志的安全要求给根据Chebyshev混乱地图设计认证办法带来了新的挑战。为了解决这一问题,我们提议采用一个实用的Chebyshev多元数字算法,采用基于平方矩阵的二进制推算法,实现安全高效的Chebyshev多元网志计算。我们进一步采用拟议的算法,为智能网格环境构建一个节能认证和关键协议计划。与最新计划相比,拟议的认证办法通过采用拟议的Chebyshev多元网志算法,有效地降低了计算成本和通信费用。此外,ProVerif工具被用于分析拟议的认证办法的安全性。我们的实验性算法证明我们拟议的保密性计算办法在达到顶级条件时可以达到顶点。