A secure key agreement protocol based on chaotic maps

To guarantee the security of communication in the public channel,many key agreement protocols have been proposed.Recently,Gong et al.proposed a key agreement protocol based on chaotic maps with password sharing.In this paper,Gong et al.’s protocol is analyzed,and we find that this protocol exhibits key management issues and potential security problems.Furthermore,the paper presents a new key agreement protocol based on enhanced Chebyshev polynomials to overcome these problems.Through our analysis,our key agreement protocol not only provides mutual authentication and the ability to resist a variety of common attacks,but also solve the problems of key management and security issues existing in Gong et al.’s protocol.