一种新型基于Chebyshev多项式的密钥协商方案

A New Identity Authentication Based on the Chebyshev Polynomial

本文选取有限域的Chebyshev多项式作为研究对象,在已有的身份认证和密钥协商方案的基础上,利用Chebyshev多项式良好的混沌特性、半群特性、单向性和周期性设计了一种新型的基于Chebyshev多项式的身份认证及密钥协商方案。该方案在身份认证的基础上可以成功协商出会话密钥,并且具有很高的安全性,主要体现在可抵抗口令猜测攻击、惟密文攻击、中间人攻击和重放攻击。最后给出了本方案的仿真效率分析。

According to the identity authentication and key agreement scheme in the past, a new scheme is proposed. The scheme makes better use of the Chebyshev polynomial based on the finite fields which has chaotic property, semi - group property, one - way trapped property and cyclical property. The scheme presented can not only make the identity authentication and get the security key between two users, but also have good security property. It is proved that the scheme can resist the attack from the password guessing, the ciphertext, the middleman and the replay. In the end, a simulation of this scheme is gives and the result shows that the scheme has high efficiency .