A new key agreement protocol based on Chebyshev chaotic maps

作者：Wang, Xingyuan^*; Wang, Siwei; Wang, Zhanjie; Zhang, Mengcan

来源：Security and Communication Networks, 2016, 9(18): 5028-5035.

DOI：10.1002/sec.1675

• Chebyshev polynomials
• chaotic maps
• key agreement protocol
• security

Recently, an enhanced key agreement protocol based on chaotic maps was proposed and it can generate secure session key and resist known key attacks. In this paper, we analyze it and point out some problems existing in this protocol. For example, this protocol cannot ensure perfect forward secrecy and cannot resist stolen-verifier attack. To overcome these drawbacks, this paper proposes a new key agreement protocol based on enhanced Chebyshev polynomials. We add a new part named the registration center to enhances the security of the protocol and it realizes mutual authentication between the user and the server. The methods of symmetric encryption and asymmetric encryption are both applied into proposed protocal so that the identity information of the users are well protected. By comparing our protocol with other existing protocols, we can conclude that this agreement can effectively complete user authentication and can resist some common attacks, and our protocol perfectly solves the weakness existing in some protocols.

• 出版日期2016-12
• 单位大连理工大学