An efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map
- Authors
- Yoon, Eun-Jun; Jeon, Il-Soo
- Issue Date
- Jun-2011
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Encryption algorithm; Chebyshev chaotic map; Key agreement protocol; Cryptography; Network security
- Citation
- COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, v.16, no.6, pp 2383 - 2389
- Pages
- 7
- Journal Title
- COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION
- Volume
- 16
- Number
- 6
- Start Page
- 2383
- End Page
- 2389
- URI
- https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/22335
- DOI
- 10.1016/j.cnsns.2010.09.021
- ISSN
- 1007-5704
1878-7274
- Abstract
- This paper proposes a new efficient and secure Diffie-Hellman key agreement protocol based on Chebyshey chaotic map. The proposed key agreement protocol uses the semi-group 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. (C) 2010 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Electronic Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.