Issue No. 10 - October (2010 vol. 59)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.148
Xiaofeng Liao , Chongqing Univeristy, Chongqing
Fei Chen , Chongqing Univeristy, Chongqing
Kwok-Wo Wong , The City University of Hong Kong
In this paper, the period distribution of sequences generated by Chebyshev polynomials over the finite field $Z_N$ is 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 $Z_N$. Then, we modify the original algorithm to make it suitable for practical purpose. Its security under some existing models is also discussed in detail.
Chaos, Chebyshev polynomials, period distribution, public-key cryptography, security analysis.
K. Wong, F. Chen and X. Liao, "On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$," in IEEE Transactions on Computers, vol. 59, no. , pp. 1392-1401, 2010.