A new key agreement protocol based on chaotic maps

22Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Yoon, E. J., & Yoo, K. Y. (2008). A new key agreement protocol based on chaotic maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4953 LNAI, pp. 897–906). https://doi.org/10.1007/978-3-540-78582-8_91

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free