Secure and Fast Hashing Algorithm with Multiple Security Levels

Secure and Fast Hashing Algorithm with Multiple Security Levels
复制标题

DOI:
10.4304/jsw.4.9.935-942
复制
发表时间:
2009-01
期刊:
J. Softw.
影响因子:
--
通讯作者:
H. Elkamchouchi;M. Nasr;R. Ismail
H. Elkamchouchi;M. Nasr;R. Ismail
中科院分区:
其他
文献类型:
--
作者:
H. Elkamchouchi;M. Nasr;R. Ismail

文献摘要

被引文献

相似文献

提出了一种新的安全快速的多安全级别散列算法(SFHA-MSL)。它基于通用3C(3压缩)构造和3C-X(3C XOR)散列函数,3C-X(3C XOR)散列函数是通用3C散列函数的最简单和有效的变体,并且它是可以实现的对Merkle-Damgard(M-D)迭代构造的最简单修改。该算法的设计原则是输出长度为128、192和256位可变,压缩函数个数可变,每个压缩函数迭代次数可变,压缩函数结构可变。该算法中使用的压缩函数在输入控制算法中发生的情况的意义上更动态。这使我们能够实现一个新颖的设计原则:当消息改变时,会进行不同的移位旋转,这会给试图创建冲突的人带来更多的复杂性。代替混合消息块的单个字,每次迭代混合四个字,这实现了更快的数据扩散,因此具有更好的雪崩效果。该方案不需要消息扩展,不使用布尔函数,仅使用加法、异或和旋转来实现安全性。除了提高算法效率之外,它还在一轮中的所有块之间分布非线性。
We propose a new secure and fast hashing algorithm with multiple security levels (SFHA-MSL). It is based on the generic 3C (3 compressions) construction and the 3C-X (3C XOR) hash function which is the simplest and efficient variant of the generic 3C hash function and it is the simplest modification to the Merkle-Damgard (M-D) iterated construction that one can achieve. The design principle of the proposed algorithm is to have variable output length of 128, 192 and 256 bits, variable number of compression functions, variable number of iterations in each compression function and variable compression function structure. The compression function used in this algorithm is more dynamic in the sense that the input controls what happen in the algorithm. This enable us to achieve a novel design principle: when message is changed, different shift rotations are done which causes more complexity for someone trying to create a collision. Instead of mixing a single word of a message block, four words are mixed per iteration which achieve faster data diffusion and hence better avalanching effect. There is no message expansion in the proposed scheme and it doesn't use Boolean functions but uses only addition, XOR and rotations to achieve its security. This in addition to increasing the algorithm efficiency, it distributes non-linearity among all blocks in a round.