A new key exchange scheme based on extended Chebyshev polynomials

Authors:
Wang Dahu;Wei Xueye
Affiliations:
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China and State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beij ...;School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
Venue:
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Year:
2005

Citing 6
Cited 0

A public key cryptosystem and a signature scheme based on discrete logarithms

Proceedings of CRYPTO 84 on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Jacobian elliptic Chebyshev rational maps

Physica D
Cryptography: Theory and Practice,Second Edition

Cryptography: Theory and Practice,Second Edition
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

Kocarev gave the first cryptosystems based on the semi-group property of Chebyshev polynomials, which seemed excellent but actually insecure. Due to the inherent periodicity of trigonometric function, an attack can easily get plaintext given ciphertext. In this paper, we extend Chebyshev polynomials from real number to finite fields to avoid the attack and present the corresponding key exchange scheme, which is secure and practical.