共查询到16条相似文献,搜索用时 78 毫秒
1.
2.
3.
4.
结合混沌系统与传统单向Hash函数设计方法的优点,提出了一种基于混沌动态S-Box的带秘密密钥的单向Hash函数构造方法.该方法用混沌S-Box替换和函数查找表来生成具有混沌特性的Hash摘要.与现有混沌Hash算法相比,新方案没有将原始数据直接参与混沌迭代,而是采用混沌动态S-Box替换来提高系统的实时性能.研究结果表明:该方法不仅有很好单向性、初值和密钥敏感性,且有较大的密钥空间,易于实现.
关键词:
Hash函数
混沌
S-Box
函数查找表 相似文献
5.
如何设计快速高效的单向Hash函数一直是现代密码学研究中的一个热点.提出了一种基于广 义混沌映射切换的Hash函数构造方法.这种方法首先构建产生多种混沌序列的广义混沌映射 模型,然后在明文信息的不同位置根据切换策略产生不同的混沌序列,并用线性变换后的信号 信息对混沌参数进行调制来构造单向Hash函数.初步分析了利用混沌映射实现单向Hash函数 的不可逆性、防伪造性、初值敏感性等特点.研究结果表明:这种基于广义混沌映射切换的Ha sh函数具有很好的单向性、弱碰撞性,较基于单一混沌映射的Hash函数具有更强的保密性能 ,且实现简单.
关键词:
Hash函数
混沌
混沌映射切换 相似文献
6.
提出了一种基于时空混沌系统的Hash函数构造方法.以线性变换后的消息数作为一组初值来驱动单向耦合映像格子的时空混沌系统,产生时空混沌序列,取其空间最后一组混沌序列的适当项,线性映射为Hash值要求的128bit值.研究结果表明,这种基于时空混沌系统的Hash函数具有很好的单向性、弱碰撞性、初值敏感性,较基于低维混沌映射的Hash函数具有更强的保密性能,且实现简单.
关键词:
时空混沌
Hash函数
单向耦合映像格子 相似文献
7.
8.
快速有效的单向Hash函数的设计是现代密码学研究的一个热点.提出了一种基于二维超混沌映射的单向Hash函数的构造方法.该方法将原始输入报文按字节进行线性变换以及混沌映射,在所产生的混沌序列中选值作为二维超混沌映射的初始值,对迭代后所得的超混沌信号经过调制构造单向Hash函数.实验与分析结果表明,这种构造方法实现简单、对初值有高度敏感性、具有很好的单向性、弱碰撞性和保密性能.
关键词:
单向Hash函数
二维超混沌
混沌映射 相似文献
9.
10.
在分析单向与双向耦合映像格子系统的初值与参数敏感性的基础上,提出了一种基于可变参数双向耦合映像系统的时空混沌单向Hash函数构造方案.该方案以耦合映像系统的部分初态作为密钥,在迭代过程中, 通过上一次的迭代值和线性变换后的不同位置的明文消息比特动态确定双向耦合映像系统模型参数,将明文消息多格点并行注入时空混沌轨迹中;取迭代序列中最后一轮迭代结果的适当空间项,线性映射为Hash值要求的128 bit值.由于耦合映像系统的双向扩散机理与混乱作用,迭代过程具有极强的不可逆性及初值与参数敏感性,Hash结果的每位都与明文及密钥有着敏感、复杂的非线性强耦合关系.仿真实验与分析结果表明,该算法达到了Hash函数的各项性能要求,安全性好,执行效率高.
关键词:
Hash函数
时空混沌
耦合映像格子 相似文献
11.
The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions. 相似文献
12.
Based on the spatiotemporal chaotic system,a novel algorithm for constructing a one-way hash function is proposed and analysed.The message is divided into fixed length blocks.Each message block is processed by the hash compression function in parallel.The hash compression is constructed based on the spatiotemporal chaos.In each message block,the ASCII code and its position in the whole message block chain constitute the initial conditions and the key of the hash compression function.The final hash value is generated by further compressing the mixed result of all the hash compression values.Theoretic analyses and numerical simulations show that the proposed algorithm presents high sensitivity to the message and key,good statistical properties,and strong collision resistance. 相似文献
13.
A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key, and it is easy to be realized and extended. 相似文献
14.
A new hash function system, based on coupled chaotic map dynamics, is suggested. By combining floating point computation of chaos and some simple algebraic operations, the system reaches very high bit confusion and diffusion rates, and this enables the system to have desired statistical properties and strong collision resistance. The chaos-based hash function has its advantages for high security and fast performance, and it serves as one of the most highly competitive candidates for practical applications of hash function for software realization and secure information communications in computer networks. 相似文献
15.
An approach for constructing keyed optical Hash function (KOHF) is proposed, which is based on cascaded phase-truncated Fourier transforms (CPTFTs). The KOHF is created from a two-step one-way encryption process with a secret key imbedded. The non-linearity and one-way functionality is introduced by cascaded optical Fourier transforms with the phase-truncation operations, which could be implemented either digitally or optically. Once two 64-bit keyed Hash values are obtained in the two-step one-way encryption processes, respectively, they are then combined to form a final 128-bit keyed Hash value, which can also be regarded as a message authentication code (MAC). Moreover, the avalanche effect is also evaluated to show the performance of constructed KOHF with a set of numerical experiments. 相似文献
16.
在对多个满足Kelber条件的滤波器组成的复合系统进行初步分析的基础上,提出了一个基于复合非线性数字滤波器的带密钥的Hash算法.算法首先构建能产生高维混沌序列的复合滤波器系统,然后在明文作用的复合序列控制下随机选择滤波器子系统,并以复合系统的初态作为密钥,以粗粒化的量化迭代轨迹作为明文的Hash值.讨论了复合系统实现Hash函数的不可逆性、防伪造性、初值敏感性等特点.研究结果表明:基于复合非线性数字滤波器的Hash算法简单快速,比基于单一混沌映射的Hash算法有着更高的安全性,同时滤波器结构中没有复杂的浮点运算,比一般复合混沌系统更易于软硬件实现.
关键词:
Hash 函数
混沌
非线性自回归数字滤波器 相似文献