期刊
IEEE TRANSACTIONS ON COMPUTERS
卷 59, 期 10, 页码 1392-1401出版社
IEEE COMPUTER SOC
DOI: 10.1109/TC.2010.148
关键词
Chaos; Chebyshev polynomials; period distribution; public-key cryptography; security analysis
资金
- National Natural Science Foundation of China [60973114, 60703035]
- Natural Science Foundation of CQ CSTC [2009BA2024, 2008BB2193]
- State Key Laboratory of Power Transmission Equipment and System Security and New Technology, Chongqing University [2007DA10512709207]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
