• Please send your full manuscript to: jocm@vip.163.com

Optimized Key Agreement Protocol Based on Chaotic Maps

Ping Zhen1, Geng Zhao2, Lequan Min1 , and Xiaodong Li2
1.University of Science and Technology Beijing, Beijing, 100083, China
2.Beijing Electronic Science and Technology institute, Beijing, 100070, China
Abstract—Many key agreement protocols based on chaotic maps have been proposed to guarantee secure communications in the network. Recently, Wang et al. proposed a new key agreement protocol based on chaotic maps. But some issues exist in this protocol, such as anonymity, key distribution and management, and password problems. In order to improve the performance of Wang et al.’s protocol, this paper proposes an optimized protocol based on Chebyshev polynomials, which can preserve user anonymity, guarantee mutual authentication and resist different attacks. The explicit analysis demonstrates that our protocol is secure, efficient and applicable.

Index Terms—Key agreement protocol, Chebyshev polynomial, Optimization

Cite: Ping Zhen, Geng Zhao, Lequan Min, and Xiaodong Li, "Optimized Key Agreement Protocol Based on Chaotic Maps," Journal of Communications, vol. 9, no. 5, pp. 398-403, 2014. Doi: 10.12720/jcm.9.5.398-403
Copyright © 2013-2017 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com