基于细胞自动机的Hash函数方法

Hash函数的设计中,不仅要求Hash算法具有较好的混乱和扩散性、弱碰撞性,而且要求算法实现的高速性。提出了一种基于规则90细胞自动机的Hash函数方法,采用具有二叉树型状态转移的规则90细胞自动机作为Hash函数方法的迭代函数。实验与分析表明,这种构造方法在具有一般Hash函数较好混乱和扩散性、较安全的碰撞性,同时由于细胞自动机结构内在适合于VLSI的结构和并行的信息处理机制而具有其他Hash方法无法比拟的速度优势。

Hash Function based on Cellular Automata

In the design of an efficient Hash function,it is required that the Hash function must have fairly good confusion,diffuse,low collision,and high-speed implementation as well.This paper proposes a cellular automata-based Hash function,which adopts rule 90 cellular automata with binary tree state transition as the iteration function of the Hash.Simulation results indicate that this method has the characteristics of good confusion,diffuse and low collision,including the advantages of high-speed implementation.