| With the rapid development of network technology,people's lives will be more closely linked with the network.So people pay more attention to network security.The security authentication protocol based on cryptography can make sure the communication security when people send messages in public channel.Therefore,many experts and scholars have been deeply involved in this field.The security authentication protocol based on Chebyshev polynomial is more efficient than those based on RSA or ECC.In recent years,more and more achievements have been made in this field.This paper mainly studies the anonymous authentication protocols based on Chebyshev polynomials.After briefly reviewing Zhu's schemes,we pointed out that there are five problems in his protocol.His scheme is vulnerable to user impersonation attacks,offline dictionary attacks and can't provide user anonymity.Moreover,in Zhu's scheme,the way of changing password is inefficient and the design of login phase is unfriendly.Then we proposed a new authentication key agreement scheme based on Chebyshev polynomial which is more security and effective.The main contents of this paper are arranged as following:In Chapter 1,we introduce the development of the key agreement scheme based on Chebyshev polynomial.In Chapter 2,we state the basic principle,the functional goals of the identity authentication protocol,analyze the identity authentication protocol involved in the basic knowledge of cryptography.In Chapter 3,we briefly review Zhu's authentication scheme and point out five problems of his scheme.In Chapter 4,we propose a new authentication key agreement scheme based on Chebyshev polynomial,compare with other protocols and analyze the security of the protocol.In Chapter 5,we propose a three-party authentication key agreement scheme based on Chebyshev polynomial and analyze the security of the protocol.In Chapter 6,we summarize the article and give expectation about research. |
PDF Full Text Request