期刊
CHINESE PHYSICS B
卷 22, 期 11, 页码 -出版社
IOP Publishing Ltd
DOI: 10.1088/1674-1056/22/11/110503
关键词
chaos; Chebyshev polynomials; key agreement protocol; security
资金
- National Natural Science Foundation of China [61370145, 61173183, 60973152]
- Doctoral Program Foundation of Institution of Higher Education of China [20070141014]
- Program for Excellent Talents in Universities of Liaoning Province, China [LR2012003]
- Natural Science Foundation of Liaoning Province, China [20082165]
- Fundamental Research Funds for the Central Universities of China [DUT12JB06]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据