Journal
CHINESE PHYSICS B
Volume 22, Issue 11, Pages -Publisher
IOP Publishing Ltd
DOI: 10.1088/1674-1056/22/11/110503
Keywords
chaos; Chebyshev polynomials; key agreement protocol; security
Categories
Funding
- 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]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available