摘要
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 conarnon attacks, but also solve the problems of key management and security issues existing in Gong et al.＇ s protocol.
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 conarnon attacks, but also solve the problems of key management and security issues existing in Gong et al.＇ s protocol.
基金
Project supported by the National Natural Science Foundation of China(Grant Nos.61370145,61173183,and 60973152)
the Doctoral Program Foundation of Institution of Higher Education of China(Grant No.20070141014)
the Program for Excellent Talents in Universities of Liaoning Province,China(Grant No.LR2012003)
the Natural Science Foundation of Liaoning Province,China(Grant No.20082165)
the Fundamental Research Funds for the Central Universities of China(Grant No.DUT12JB06)
