On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field Z(N)

[摘要]：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.

[全文传递流程]：

一般上传文献全文的时限在1个工作日内