A Parallel Hash Function with Variable Initial Values

作者：Zhang, Peng^*; Zhang, Xiaomei; Yu, Jianping

来源：Wireless Personal Communications, 2017, 96(2): 2289-2303.

DOI：10.1007/s11277-017-4298-9

• Hash function
• Compression function
• Iterative structure
• Parallel structure
• Variable initial values

In recent years, considerable effort has been devoted to research on hash function. Nevertheless, it's hard to obtain the proporties of sensitivity, confusion and diffusion, collision resistance, and high efficiency simultaneously. Based on research of all attacks to classical hash functions, we propose a parallel and collision resistance hash function. With regard to the design of compression function, in order to resist attacks, such as birthday attack, forgery attack and multi-collision attack, we change the initial value of the chaining variable, which is processed through three-round iterations. On the aspect of iterative structure, instead of calculating sequentially, a parallel structure is designed. The improvement lies in the combination of two message blocks independently in each round. The statistical data and experimental analysis prove that the designed hash function algorithm has good properties of confusion and diffusion, collision resistance and superior efficiency, which can make it become a new type of candidate for hash function.

• 出版日期2017-9
• 单位深圳大学