|
|
A secure key agreement protocol based on chaotic maps |
Wang Xing-Yuan (王兴元), Luan Da-Peng (栾大朋) |
Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024, China |
|
|
Abstract 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.
|
Received: 06 March 2013
Revised: 22 May 2013
Accepted manuscript online:
|
PACS:
|
05.45.Vx
|
(Communication using chaos)
|
|
05.45.-a
|
(Nonlinear dynamics and chaos)
|
|
Fund: 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), and the Fundamental Research Funds for the Central Universities of China (Grant No. DUT12JB06). |
Corresponding Authors:
Wang Xing-Yuan
E-mail: wangxy@dlut.edu.cn
|
Cite this article:
Wang Xing-Yuan (王兴元), Luan Da-Peng (栾大朋) A secure key agreement protocol based on chaotic maps 2013 Chin. Phys. B 22 110503
|
[1] |
Liu B and Peng J 2004 Nonlinear Dynamics (Beijing: High Education Press) p. 13
|
[2] |
Mao Y B, Chen G Y and Lian S G 2004 Int. J. Bifurcat. Chaos 14 3613
|
[3] |
Xiang T, Liao X F, Tang G P, Chen Y and Wong K 2006 Phys. Lett. A 349 109
|
[4] |
Wang X Y and Jin C Q 2011 Opt. Commun. 285 412
|
[5] |
Wang Z, Huang X, Li N and Song X N 2012 Chin. Phys. B 21 050506
|
[6] |
Chen G, Chen Y and Liao X F 2007 Chaos Soliton. Fract. 31 571
|
[7] |
Xiao D, Liao X F and Deng S J 2005 Chaos Soliton. Fract. 24 65
|
[8] |
Menezes A, van Oorschot P and Vanstone S 1997 Handbook of Applied Cryptography (Boca Raton: CRC Press) p. 1
|
[9] |
Kocarev L and Tasev Z 2003 Proceedings of the 2003 International Symposium on Circuits and Systems 3 28
|
[10] |
Bergamo P, D’Arco P, Santis A and Kocarev L 2005 IEEE Tran. Circuits-I 52 1382
|
[11] |
Bose R 2005 Phys. Rev. Lett. 95 098702
|
[12] |
Wang K, Pei W J, Zou L H, Cheung Y and He Z Y 2006 Phys. Lett. A 360 259
|
[13] |
Zhang L H 2008 Chaos Soliton. Fract. 37 669
|
[14] |
Xiao D, Liao X F and Deng S J 2007 Inform. Sci. 177 1136
|
[15] |
Han S 2008 Chaos Soliton. Fract. 38 764
|
[16] |
Xiang T, Wong K W and Liao X F 2009 Chaos Soliton. Fract. 40 672
|
[17] |
Chang E and Han S 2006 CBS-IS-2006 Technical Report (Curtin University of Technology) 1
|
[18] |
Han S and Chang E 2009 Chaos Soliton. Fract. 39 1283
|
[19] |
Yoon E J and Yoo K Y 2008 Replay Attacks on Han et al.’s Chaotic Map Based Key Agreement Protocol Using Nonce (Berlin: Springer) p. 533
|
[20] |
Tseng H R, Jan R H and Yang W 2009 IEEE International Conference on Communications (Dresden:) p. 1
|
[21] |
Niu Y J and Wang X Y 2011 Commun. Nonlinear Sci. Numer. Simul. 16 1986
|
[22] |
Xue K P and Hong P L 2012 Commun. Nonlinear Sci. Numer. Simul. 17 2969
|
[23] |
Yoon E J 2012 Commun. Nonlinear Sci. Numer. Simul. 17 2735
|
[24] |
Lee C C, Chen C L, Wu C Y and Huang S Y 2012 Nonlinear Dyn. 69 79
|
[25] |
Gong P, Li P and Shi W B A 2012 Nonlinear Dyn. 70 2401
|
[26] |
Schneier B 1996 Applied Cryptography: Protocol, Algorithms and Source Code in C (2nd edn.) (New York: John Wiley & Sons) p. 1
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|