Hash functions and information theoretic security

Nasoor Bagheri, Lars Ramkilde Knudsen, Majid Naderi, Søren Steffen Thomsen

    Research output: Contribution to journalLetterResearchpeer-review

    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.
    Original languageEnglish
    JournalI E I C E Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE92-A
    Issue number12
    Pages (from-to)3401-3403
    ISSN0916-8508
    DOIs
    Publication statusPublished - 2009

    Cite this