A New Black Box Analysis of Hash Functions Based on Block Ciphers  

作　　者：达林 多磊 Matt Henricksen 李超 

机构地区：[1]School of Mechanical Electronic and Control Engineering,Beijing Jiaotong University,Beijing 100044,China [2]Department of Science,National University of Defense Technology,Changsha 410073,China [3]Institute for Infocomm Research,Singapore

出　　处：《Journal of Shanghai Jiaotong university(Science)》2008年第6期664-669,共6页上海交通大学学报（英文版）

基　　金：the National Natural Science Foundation of China (No. 60573028)

摘　　要：For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and proved that 20 schemes are collision resistant.This paper improves the upper and lower bounds and make contrast with a hash constructed from a random oracle.These 20 schemes have only one kind of collision resistance upper and lower bounds.In addition, we present new advantages for finding second preimages.For the 64 most basic ways to construct a hash function H ： {0, 1}^＊ → {0, 1}^n from a block cipher E ： {0, 1}^n× {0, 1}^n → {0, 1}^n, Black et al. provided a formal and quantitative treatment of the 64 constructions, and proved that 20 schemes are collision resistant. This paper improves the upper and lower bounds and make contrast with a hash constructed from a random oracle. These 20 schemes have only one kind of collision resistance upper and lower bounds. In addition, we present new advantages for finding second preimages.

关 键 词：hash functions block cipher Merkel Damagard construction black box model 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]