Hash Functions and Information Theoretic Security

Nasour BAGHERI; Lars R. KNUDSEN; Majid NADERI; Søren S. THOMSEN

doi:10.1587/transfun.E92.A.3401

Regular Section

Hash Functions and Information Theoretic Security

Nasour BAGHERI, Lars R. KNUDSEN, Majid NADERI, Søren S. THOMSEN

Author information

Keywords: hash functions, information theoretic security, query complexity, permutation-based hash functions

JOURNAL RESTRICTED ACCESS

2009 Volume E92.A Issue 12 Pages 3401-3403

DOI https://doi.org/10.1587/transfun.E92.A.3401

Details

Abstract

Information theoretic security is an important security notion in cryptography as it provides a true lower bound for attack complexities. However, in practice attacks often have a higher cost than the information theoretic bound. In this paper we study the relationship between information theoretic attack costs and real costs. We show that in the information theoretic model, many well-known and commonly used hash functions such as MD5 and SHA-256 fail to be preimage resistant.

Corresponding author

Register with J-STAGE for free!