A secure key agreement protocol based on chaotic maps  

A secure key agreement protocol based on chaotic maps

在线阅读下载全文

作  者:王兴元 栾大朋 

机构地区:[1]Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology

出  处:《Chinese Physics B》2013年第11期239-243,共5页中国物理B(英文版)

基  金: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);the Fundamental Research Funds for the Central Universities of China(Grant No.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 conarnon attacks, but also solve the problems of key management and security issues existing in Gong et al.' s protocol.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 conarnon 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 

分 类 号:O415.5[理学—理论物理] TN918.1[理学—物理]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象