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

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.