中国物理B ›› 2013, Vol. 22 ›› Issue (11): 110503-110503.doi: 10.1088/1674-1056/22/11/110503

• GENERAL • 上一篇    下一篇

A secure key agreement protocol based on chaotic maps

王兴元, 栾大朋   

  1. Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024, China
  • 收稿日期:2013-03-06 修回日期:2013-05-22 出版日期:2013-09-28 发布日期:2013-09-28
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 61370145, 61173183, and 60973152), the Doctoral Program Foundation of Institution of Higher Education of China (Grant No. 20070141014), the Program for Excellent Talents in Universities of Liaoning Province, China (Grant No. LR2012003), the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165), and the Fundamental Research Funds for the Central Universities of China (Grant No. DUT12JB06).

A secure key agreement protocol based on chaotic maps

Wang Xing-Yuan (王兴元), Luan Da-Peng (栾大朋)   

  1. Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian 116024, China
  • Received:2013-03-06 Revised:2013-05-22 Online:2013-09-28 Published:2013-09-28
  • Contact: Wang Xing-Yuan E-mail:wangxy@dlut.edu.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 61370145, 61173183, and 60973152), the Doctoral Program Foundation of Institution of Higher Education of China (Grant No. 20070141014), the Program for Excellent Talents in Universities of Liaoning Province, China (Grant No. LR2012003), the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165), and the Fundamental Research Funds for the Central Universities of China (Grant No. DUT12JB06).

PDF (PC)

1580

赞

摘要： To guarantee the security of communication in the public channel, many key agreement protocols have been proposed. Recently, Gong et al. proposed a key agreement protocol based on chaotic maps with password sharing. In this paper, Gong et al.’s protocol is analyzed, and we find that this protocol exhibits key management issues and potential security problems. Furthermore, the paper presents a new key agreement protocol based on enhanced Chebyshev polynomials to overcome these problems. Through our analysis, our key agreement protocol not only provides mutual authentication and the ability to resist a variety of common attacks, but also solve the problems of key management and security issues existing in Gong et al.’s protocol.

关键词: chaos, Chebyshev polynomials, key agreement protocol, security

Abstract: To guarantee the security of communication in the public channel, many key agreement protocols have been proposed. Recently, Gong et al. proposed a key agreement protocol based on chaotic maps with password sharing. In this paper, Gong et al.’s protocol is analyzed, and we find that this protocol exhibits key management issues and potential security problems. Furthermore, the paper presents a new key agreement protocol based on enhanced Chebyshev polynomials to overcome these problems. Through our analysis, our key agreement protocol not only provides mutual authentication and the ability to resist a variety of common attacks, but also solve the problems of key management and security issues existing in Gong et al.’s protocol.

Key words: chaos, Chebyshev polynomials, key agreement protocol, security

中图分类号:  (Communication using chaos)

  • 05.45.Vx
05.45.-a (Nonlinear dynamics and chaos)