基于Chebyshev多项式的公钥密码及密钥协商的研究-密码学专业论文.docxVIP

摘要 在信息化时代的今天，信息化引发的信息安全问题越来越受到广泛的关注和 重视，目前已成为世界性的重要问题。密码学是保障信息安全的核心，信息安全 是密码学研究和发展的目的。随着计算机科学的蓬勃发展，传统密码的安全性受 到了严重威胁。混沌系统因其独有的宽频谱、类随机特性、对结构参数及初始状 态的极端敏感性等一系列性质，使得混沌成为密码学研究的一个重要领域。 目前，对于混沌的研究大部分局限于对称加密范畴，利用混沌来构造公钥密 码的研究较少。基于混沌的公钥密码算法中最具代表性的是由 L.Kocarev 提出的 基于 Chebyshev 多项式的公钥密码算法。把 Chebyshev 多项式扩展到有限域上的 密码算法被证明依然有很多问题。在此基础上，本文引入“可选择性乘法系数” 这一概念，提出一种改进的基于有限域 Chebyshev 多项式的类 ElGamal 算法。理 论分析和编程实现证明该算法可以有效抵抗惟密文攻击和防篡改攻击，同时具有 身份认证功能，具有潜在的实用价值。 另外，提出了一种改进的基于有限域 Chebyshev 多项式的密钥协商方案。该 方案利用 RSA 算法加解密通信双方的 Chebyshev 多项式值，从而隐藏密文值，避 免以往针对 Chebyshev 多项式的强周期性的种种攻击，保证密钥协商的安全。同 时，该方案还具有身份认证功能。理论分析和软件实现证明了该方案的正确性、 有效性和安全性。 关键词：公钥密码 Chebyshev 多项式 可选择性乘法系数 密钥协商 Abstract Nowadays, the security of information draws more and more attentions, and it has become into a worldwide issue. Cryptography is the core of information security which is the purpose of Cryptography. Chaotic system has great application value in cryptography because of its broadband spectrum, sensitive dependence on initial conditions, pseudo-randomness and so on. Up to now, a lot of researches focused on symmetric-key cryptosystems, but less applied to public-key cryptosystems. The most representative public-key cryptography based on chaos is the public-key cryptography algorithms based on Chebyshev polynomials which was proposed by L.Kocarev. But the algorithm was proved not safe, even extended to finite fields. So, this paper proposed an improved ElGamal-like algorithm using the semi-group property of Chebyshev polynomials based on finite fields. The key point of this algorithm was the appointment of “the alternative multiply coefficient ki ” which can forge the ciphertext tactfully and make the chosen-ciphertext attack out of work. Besides, the digital signature of the ciphertext can prevent the result from faking and tampering attack and make it have the function of identity authentication. Experimental results and performance analyses showed that the improved algorithm has much higher security and practical v