基于Chebyshev多项式的椭圆曲线密码算法研究-密码学专业论文.docxVIP

万方数据 万方数据 摘要 混沌系统和密码学之间有着结构上的相似性，将混沌应用于密码学领域逐渐 引起人们的重视，相对于人们在混沌对称加密范畴的研究而言，人们对于混沌公 钥密码系统的研究却很少。L.Kocarev 提出了一种基于 Chebyshev 多项式的公钥密 码算法，该算法的提出引起了人们对于混沌公钥密码算法的强烈兴趣，然而，该 算法存在着明显的缺陷性，影响了混沌公钥在实际中的应用。 本文分析了 L.Kocarev 提出的公钥密码算法的缺点，该算法效率较低，实用 性较差，在此基础上，提出了基于 Chebyshev 多项式的椭圆曲线密码算法，该算 法主要利用了 Chebyshev 多项式的半群性质和椭圆曲线上的性质，将原算法的乘 法群扩展到了椭圆曲线群上，从而提高了算法的效率，对于新算法，我们对其进 行了可行性、安全性、有效性和实用性分析，通过对理论分析和软件编程实现证 明，该算法效率得到提高，应用前景广阔，对于混沌公钥密码体制的研究是有意 义的，具有一定的创新性。 另外，我们又提出了一种新的基于 Chebyshev 多项式的椭圆曲线密码算法， 该算法主要利用 Chebyshev 多项式产生伪随机数构造算法，我们通过理论对该算 法的性能进行了分析。 关键词：混沌密码 Chebyshev 多项式 椭圆曲线算法 半群特性 Abstract There is a structural similarity between chotic system and cryptography,applying chostic system to the field of cryptography gradually attracted peoples attention.a lot of researches focused on symmetric-key cryptosystems, but less applied to public-key cryptosystem. L.Kocarev proposed the public-key cryptography algorithm based on Chebyshev polynomial, this algorithm has attracted peoples intrest, However, it has some problems, affecting the practical application of chaos in the Public-key Cryptographic Algorithm. We analyzed the problems of the Public-key Cryptographic Algorithm which was proposed by L.Kocarev, the algorithm has low efficiency and poor practicability,on this basis, we propose the Elliptic Curve Cryptosystem algorithm based on Chebyshev polynomial, it makes use of the semi-groop property of the chebyshev and the properties of the Elliptic Curve,we extend the multiplicative group to the elliptic cure group,so we improve the efficiency of the algorithm,to the new algorithm,we analyzed the feasibility,safety,efficiency and practicality of the algorithm,Experimental results and performance analyses showed that the efficiency of the algorithm has improved,the prospect of the application is broad,the research is meaningful and innovative for the public-key cryptosystem based on chostic system. In addition, we propose a new algorithm which is the the Elliptic Curve Cryptosystem algorithm b