[1]徐刚,丁松阳,张墨华.基于有限域上Chebyshev多项式的Diffie-Hellman密钥协商算法[J].郑州大学学报(工学版),2014,35(02):50-54.[doi:10.3969/j.issn.1671-6833.2014.02.012]
　XU Gang,DING Songyang,ZHANG Mohua.Diffie-Hellman Key Agreement Protocol Based onChebyshev Polynomials over Finite Field[J].Journal of Zhengzhou University (Engineering Science),2014,35(02):50-54.[doi:10.3969/j.issn.1671-6833.2014.02.012]
点击复制

基于有限域上Chebyshev多项式的Diffie-Hellman密钥协商算法()
分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
35
期数:
2014年02期
页码:
50-54
栏目:
出版日期:
2014-04-30

文章信息/Info

Title:
Diffie-Hellman Key Agreement Protocol Based onChebyshev Polynomials over Finite Field
作者:
徐刚; 丁松阳; 张墨华
Author(s):
XU Gang;  DING Songyang;  ZHANG Mohua
College of Computer and Information Engineering, Henan University of Eeonomies and Law, Zhengzhou 450002, China
Keywords:
Chebyshev polynomials;  finite field;  Diffie-Hellman key agreement prooeol;  message authentieation code
DOI:
10.3969/j.issn.1671-6833.2014.02.012
文献标志码:
A
Abstract:
In order to construet high speed and security key agreement protocol using chaotie system, we studyone of the existing key agreement protoeols based on Chebyshev polynomial, eonstruet an improved key agree.ment protoeol by utilizing the semi-group property of Chebyshev polynomials and message authentieation code.which can eomplete the identity authentieation between eommunication paries and eonfirm the consisteney olthe session key. The proposed key agreement protocol is efficient and seeure, which is proved by the erypta-nalysis.
更新日期/Last Update: