✦ LIBER ✦

An efficient and secure Diffie–Hellman key agreement protocol based on Chebyshev chaotic map

✍ Scribed by Eun-Jun Yoon; Il-Soo Jeon

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 505 KB
Volume: 16
Category: Article
ISSN: 1007-5704
DOI: 10.1016/j.cnsns.2010.09.021

No coin nor oath required. For personal study only.

✦ Synopsis

This paper proposes a new efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map. The proposed key agreement protocol uses the semigroup property of Chebyshev polynomials to agree Diffie-Hellman based session key. The proposed protocol provides strong security compared with the previous related protocols. In addition, the proposed protocol does not require any timestamp information and greatly reduces computational costs between communication parties. As a result, the proposed protocol is more practical and provides computational/communicational efficiency compare with several previously proposed key agreement protocols based on Chebyshev chaotic map.

📜 SIMILAR VOLUMES

An anonymous key agreement protocol base

An anonymous key agreement protocol based on chaotic maps

✍ Yujun Niu; Xingyuan Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Recently, Tseng et al. proposed a novel key agreement protocol based on chaotic maps. They claimed that the protocol achieved session key agreement between a server and a user, and allowed the user to anonymously interact with the server. This paper, however, will demonstrate that Tseng et al.'s pro