𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved key agreement protocol based on chaos

✍ Scribed by Xingyuan Wang; Jianfeng Zhao

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
209 KB
Volume
15
Category
Article
ISSN
1007-5704

No coin nor oath required. For personal study only.

✦ Synopsis

Cryptography based on chaos theory has developed fast in the past few years, but most of the researches focus on secret key cryptography. There are few public key encryption algorithms and cryptographic protocols based on chaos, which are also of great importance for network security. We introduce an enhanced key agreement protocol based on Chebyshev chaotic map. Utilizing the semi-group property of Chebyshev polynomials, the proposed key exchange algorithm works like Diffie-Hellman algorithm. The improved protocol overcomes the drawbacks of several previously proposed chaotic key agreement protocols. Both analytical and experimental results show that it is effective and secure.

πŸ“œ 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

Strongly secure identity-based authentic
Strongly secure identity-based authenticated key agreement protocols
✍ Liang Ni; Gongliang Chen; Jianhua Li; Yanyan Hao πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 272 KB

In this paper, we present a strongly secure identity-based (ID-based) two-party authenticated key agreement (AKA) protocol, which captures all basic desirable security properties including master key forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extend

An efficient and secure Diffie–Hellman k
An efficient and secure Diffie–Hellman key agreement protocol based on Chebyshev chaotic map
✍ Eun-Jun Yoon; Il-Soo Jeon πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 505 KB

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 comp