Cryptanalysis of a class of cryptographic hash functions
نویسندگان
چکیده
We apply new cryptanalytical techniques to perform the generic multi-block multicollision, second preimage and herding attacks on the Damg̊ard-Merkle hash functions with linear-XOR/additive checksums. The computational work required to perform these attacks on the Damg̊ard-Merkle hash functions with linear-XOR/additive checksum of message blocks (GOST), intermediate states (3C, MAELSTROM-0, F-Hash) or both is only a little more than what is required on the Damg̊ard-Merkle hash functions. Our generic attacks on GOST answers the open question of Hoch and Shamir at FSE 2006 on the security of the iterated hash functions with the linear mixing of message blocks.
منابع مشابه
Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملCRUSH: A New Cryptographic Hash Function using Iterated Halving Technique
Most of the currently accepted designs for cryptographic hash functions are in the style of a block cipher in feed-forward mode. With increasing interest in all forms of cryptanalysis, this limited choice might become a single point of failure in computer security, and so we seek alternative paradigms. In this paper an entirely new approach, based on iterated halving (IH), is proposed for the d...
متن کاملA Systems Theoretic Approach to the Design of Scalable Cryptographic Hash Functions
Cryptographic hash functions are security primitives that compute check sums of messages in a strong manner and this way are of fundamental importance for ensuring integrity and authenticity in secure communications. However, recent developments in cryptanalysis indicate that conventional approaches to the design of cryptographic hash functions may have some shortcomings. Therefore it is the in...
متن کاملCryptanalysis of the SHA-3 candidates EnRUPT and SHAMATA
In this talk, we review the successful cryptanalysis of two cryptographic hash functions, EnRUPT and SHAMATA. Both were submitted as candidates to the NIST SHA-3 competition.
متن کاملCryptanalysis of a Provably Secure Cryptographic Hash Function
We present a cryptanalysis of a provably secure cryptographic hash function proposed by Augot, Finiasz and Sendrier in [1]. Our attack is a variant of Wagner’s generalized birthday attack. It is significantly faster than the attack considered in [1], and it is practical for two of the three proposed parameters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007