Public-key Cryptosystem Algorithm Based on Chebyshev Polynomial
Tong Zong-ke · Jisuanji gongcheng · 2008
This paper introduces the definiteness and properties of Chebyshev polynomial based on finite fields.It studies the security of the ElGamal-like cryptosystem based on Chebyshev polynomial of finite fields,and proposes a modified public-key cryptosystem.In the modified public-key cryptosystem,the secret key is hidden from public key,and it can not be calculated by public key.Analysis shows that the modified system is accurate and doable,and it is better than the ElGamal public-key cryptosystem based on finite fields Chebyshev polynomial.