NAVIGATE

Table of Contents

STATISTICS

Viewed2556

Downloads1915

Diffie-Hellman Key Agreement Protocol Based onChebyshev Polynomials over Finite Field
  PDF下载 (1915)
[1]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]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN 1671-6833/CN 41-1339/T] Volume: 35 Number of periods: 2014 02 Page number: 50-54 Column: Public date: 2014-04-30
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
CLC:
-
DOI:
10.3969/j.issn.1671 -6833.2014.02.012
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.
References:
-
Similar References:
Memo

-

Last Update:
Copyright © 2023 Editorial Board of Journal of Zhengzhou University (Engineering Science)