Security of Public-key Cryptosystems Based on Chebyshev Polynomials over Prime Finite Fields

摘要

In this paper, a new definition of Chebyshev polynomials over prime finite fields is introduced. Our approach uses a finite field trigonometry and reveals some aspects concerning the security of a recently proposed public-key encryption algorithm based on those polynomials. Particularly, we show that recovering the corresponding plaintext from a given ciphertext involves the discrete logarithm problem.