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
An anonymous key agreement protocol based on chaotic maps
β Scribed by Yujun Niu; Xingyuan Wang
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 192 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1007-5704
No coin nor oath required. For personal study only.
β¦ Synopsis
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 protocol can not guarantee user anonymity and protocol security against an insider adversary who is a legal user, and it can not provide perfect forward secrecy. Furthermore, the current paper presents a new key agreement protocol based on Chebyshev chaotic map in order to conquer these problems. In contrast with Tseng et al.'s protocol, the proposed protocol is more secure and preserves user anonymity.
π SIMILAR VOLUMES
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 a