Hash Functions and Information Theoretic Security

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• （社）電子情報通信学会の論文
• 2009-12-01

著者

• BAGHERI Nasour

  Electrical Engineering Department of Iran University of Science and Technology

• KNUDSEN Lars

  Department of Mathematics of Technical University of Denmark

• NADERI Majid

  Electrical Engineering Department of Iran University of Science and Technology

• THOMSEN Soren

  Department of Mathematics of Technical University of Denmark

関連論文

• Hash Functions and Information Theoretic Security
• Hash Functions and Information Theoretic Security
• EPC : A Provably Secure Permutation Based Compression Function

スポンサーリンク