一种新型的具有可变散列输出的Hash函数

一种新型的具有可变散列输出的Hash函数 A Fast New Hashing Algorithm with Variable Length of Output 刘建东 LIU Jiandong 1 first-author 江慧娜 JIANG Huina 1 杨凯 YANG Kai 1 北京石油化工学院信息工程学院 北京石油化工学院信息工程学院 Information Engineering College,Beijing Institute of Petrochemical Technology Information Engineering College,Beijing Institute of Petrochemical Technology 给出一种具有可变散列输出的Hash算法.该算法可以把任意长的消息散列成160,192,224或256比特的消息摘要.算法采用了分段式非线性码字扩展方案,通过整数帐篷映射拉伸与折叠的非线性本质实现消息的非线性扩展,将整数帐篷映射与传统的逻辑函数相结合,作为压缩函数迭代过程的非线性部件,具有较为理想的混淆与扩散特性.压缩函数内部采用了并行迭代结构,有利于软硬件高速并行实现. This paper proposes a fast novel cryptographic one-way hashing algorithm that can compress a message of arbitrary length into a digest of 160,192,224 or 256 bits.The algorithm adopts a piece-wise-nonlinear message expansion scheme,which is realized through the rolled-out and folded-over of the integer tent maps.In addition,the algorithm combines the integer tent map with the traditional logic functions as major nonlinear component of compression function,and so the scheme has ideal properties of diffusion and confusion.Furthermore,the parallel iteration structure is adopted in the compression functions,which is advantageous to high speed parallel operation of software and hardware. Hash函数 帐篷映射 码字扩展 非线性 扩散 Hash function tent map message expansion nonlinear diffusion 10.14188/j.1671-8836.2010.02.003 TN918.1 北京市教委科技发展计划项目（KM200710017007） 2010-02-01 2021-04-01 2 56