On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$
Xiaofeng Liao, Fei Chen, Kwok‐Wo Wong · IEEE Transactions on Computers · 2010
In this paper, the period distribution of sequences generated by Chebyshev polynomials over the finite field ZNis analyzed. It is found that the distribution is unsatisfactory if N (the modulus) is not chosen properly. Based on this finding, we present an attack on the public-key algorithm based on Chebyshev polynomials over ZN. Then, we modify the original algorithm to make it suitable for practical purpose. Its security under some existing models is also discussed in detail.