Abstract
In 2007, Xiao et al.’s proposed a novel key agreement protocol based on chaotic maps. Recently, Han et al., however, pointed out that Xiao et al.’s protocol is not secure against their developed new attacks which can hinder the user and the server from accomplishing a shared secret session key. In addition Han et al.’s attack, the current paper demonstrates that Xiao et al.’s protocol is vulnerable to off-line password guessing attack. Furthermore, the current paper presents a new key agreement protocol based on chaotic maps in order to isolate such security problems. In contrast with Xiao et al.’s protocol, the proposed protocol is more secure and can be reduced the numbers of communication rounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dachselt, F., Schwarz, W.: Chaos and cryptography. IEEE Trans Circ Syst-I, Fundam Theory 48(12), 1498–1509 (2001)
Fridrich, G.: Symmetric ciphers based on two-dimensional chaotic maps. Int. J. Bifur. Chaos. 8, 1259–1284 (1998)
Pecorra, T.L., Carroll, T.L.: Driving systems with chaotic signals. Phys. Rev. A 44(4), 2374–2383 (1991)
Kocarev, L.: Chaos-based cryptography: a brief overview. IEEE Circ. Syst. Mag. 1, 6–21 (2001)
Wong, K.W.: A fast chaotic cryptographic scheme with dynamic look-up table. Phys. Lett. A 298, 238–242 (2002)
Grassi, G., Mascolo, S.: IEEE Trans. Circ. Syst. I. Fundam. Theory. Appl. 46, 1135 (1999)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of applied cryptography. CRC Press, Boca Raton (1997)
Kocarev, L., Tasev, Z.: Public-key encryption based on Chebyshev maps. In: Proc IEEE Symp Circ Syst (ISCAS 2003), vol. 3, pp. 28–31 (2003)
Bergamo, P., D’Arco, P., Santis, A., Kocarev, L.: Security of public key cryptosystems based on Chebyshev polynomials. IEEE Trans Circ Syst-I 52(7), 1382–1393 (2005)
Xiao, D., Liao, X.F., Deng, S.: A novel key agreement protocol based on chaotic maps. Inform. Sci. 177, 1136–1142 (2007)
Han, S.: Security of a key agreement protocol based on chaotic maps. Chaos, Solitons & Fractals (in press) doi:10.1016 /j.chaos.2007.01.017
Gong, L., Lomas, M.A., Needham, R., Saltzer, J.: Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications 11(5), 648–656 (1993)
Ding, Y., Horster, P.: Undetectable on-line password guessing attacks. ACM Operating Systems Review 29(4), 77–86 (1995)
Rivlin, T.J.: Chebysheve polynomials. John Wiley and Sons, Inc., New York (1990)
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transaction on Information Theory IT-22(6), 644–654 (1976)
Schneier, B.: Applied cryptography protocols. Algorithms and Source Code in C, 2nd edn. John Wiley, Chichester (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoon, EJ., Yoo, KY. (2008). A New Key Agreement Protocol Based on Chaotic Maps. In: Nguyen, N.T., Jo, G.S., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2008. Lecture Notes in Computer Science(), vol 4953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78582-8_91
Download citation
DOI: https://doi.org/10.1007/978-3-540-78582-8_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78581-1
Online ISBN: 978-3-540-78582-8
eBook Packages: Computer ScienceComputer Science (R0)