混沌消息认证码的研究

发布时间：2018-04-13 12:17

本文选题：消息认证码 + 混沌映射　；参考：《长沙理工大学》2014年硕士论文

【摘要】：信息时代的到来尤其是互联网的快速发展使得数字信息的传播和应用受到了空前的关注重视,确保数字信息在通信时的安全有效性一直以来都是保密通信研究的热点。消息认证码作为验证数据合法性的一种常见方法被应用于金融、商业系统等各种各样的安全系统中,是确保数字信息在通信信道中能够安全传输的有效屏障。而混沌加密算法表现出来的良好性能和光明应用前景为信息认证码算法的设计研究提供了有利条件,将混沌现象的优良特性有效应用于消息认证码的算法设计中是研究混沌密码学的另一重要研究方向。本文在认真学习研究现有混沌消息认证码相关成果的基础上,针对混沌消息认证码算法的构造方法,以及消息认证码的核心——混沌hash函数的设计研究进行深入学习钻研,采用理论与实验相结合的方法,对算法的实验数据和安全性能做出了详细解析。首先,在分析证明已有算法HMAC (Hashed Message Authentication Code)算法存在的固有缺陷的基础上,给出了针对HMAC参数的伪造攻击实例。提出了一种基于经典混沌映射的改进方案,采用经典混沌映射级联方式构造一个混沌序列发生器,利用秘密密钥以及明文消息块作为混沌映射输入,动态生成HMAC参数值,使攻击者无法捕捉到参数生成的轨迹。该方案通过混沌迭代生成HMAC参数值,混沌系统的初值敏感和不可预测性确保了参数值的动态性,从而有效抵抗伪造攻击,提高HMAC算法的安全性能。并对算法的统计性能和抗碰撞性能进行了matlab实验仿真,实验结果表明,该方案能够动态生成HMAC算法参数,有效地防御因常态参数造成的伪造攻击。此外,针对消息认证码的核心算法hash函数部分给出了一种新型时空混沌双扰动的混沌hash构造方案,该方案是一个耦合方式和m序列同时施加扰动的时空混沌系统,用Chebyshev映射迭代值作为双向耦合帐篷时空混沌模型的初值,产生的序列具备较好的扩散和混乱特性,在时空混沌迭代末端,加入m序列产生器对选定的hash初值施加扰动,以抵抗存在性伪造攻击等攻击。利用该模型可以实现任意长度明文序列转换成为160位hash值。经过matlab实验仿真,实验结果表明,该方案具备了良好的初值敏感性、抗碰撞性能以及其他hash安全性要求,可以抵抗针对带密钥hash函数算法的各种攻击,是一种安全性能良好且能与消息认证等其他网络技术有效融合使用的算法。
[Abstract]:With the arrival of the information age, especially the rapid development of the Internet, the dissemination and application of digital information has received unprecedented attention. To ensure the security and effectiveness of digital information in communication has always been a hot topic in the research of secure communication.As a common method to verify the validity of data message authentication codes are used in various security systems such as finance commercial systems and so on. It is an effective barrier to ensure the secure transmission of digital information in communication channels.The good performance of the chaotic encryption algorithm and the bright application prospects provide favorable conditions for the design and research of the information authentication code algorithm.It is another important research direction to study chaos cryptography by applying the excellent characteristic of chaos to the algorithm design of message authentication code.On the basis of studying and studying the related achievements of chaotic message authentication code, this paper studies the construction method of chaotic message authentication code algorithm and the design of chaotic hash function, which is the core of message authentication code.The experimental data and security performance of the algorithm are analyzed in detail by combining theory with experiment.Firstly, on the basis of analyzing and proving the inherent defects of the existing algorithm HMAC Hashed Message Authentication Code, an example of HMAC parameter forgery attack is given.In this paper, an improved scheme based on classical chaotic mapping is proposed. A chaotic sequence generator is constructed by cascading the classical chaotic map. The secret key and clear message block are used as the chaotic map input, and the HMAC parameter values are dynamically generated.An attacker is unable to capture the path generated by the parameter.The HMAC parameter value is generated by chaotic iteration. The sensitivity and unpredictability of the initial value of chaotic system ensure the dynamic property of the parameter value, thus effectively resist forgery attack and improve the security performance of the HMAC algorithm.The statistical performance and anti-collision performance of the algorithm are simulated by matlab. The experimental results show that the scheme can dynamically generate the parameters of the HMAC algorithm and effectively defend against forgery attacks caused by the normal parameters.In addition, for the core algorithm of message authentication code (hash), a novel chaotic hash construction scheme is proposed, which is a coupled system with m sequences and m sequences perturbed at the same time.Using the iterative value of Chebyshev map as the initial value of bidirectional coupling tent spatiotemporal chaotic model, the resulting sequence has good diffusion and chaos characteristics. At the end of spatiotemporal chaos iteration, m sequence generator is added to disturb the selected initial value of hash.To resist existential forgery attacks, etc.The model can be used to convert any length of plaintext sequence to 160-bit hash value.Through matlab simulation, the experimental results show that the scheme has good initial value sensitivity, anti-collision performance and other hash security requirements, and can resist all kinds of attacks against the algorithm with key hash function.It is an algorithm with good security and can be used with other network technologies such as message authentication.
【学位授予单位】：长沙理工大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN918.4;O415.5

【参考文献】