Open AccessJournal Article
Security analysis of SHA-256 and sisters
Henri Gilbert,Helena Handschuh +1 more
TLDR
In this article, the security of SHA-256, SHA-384 and SHA-512 against collision attacks was studied. But the authors concluded that neither Chabaud and Joux's attack, nor Dobbertin-style attacks also don't apply on the underlying structure.Abstract:
This paper studies the security of SHA-256, SHA-384 and SHA-512 against collision attacks and provides some insight into the security properties of the basic building blocks of the structure. It is concluded that neither Chabaud and Joux's attack, nor Dobbertin-style attacks apply. Differential and linear attacks also don't apply on the underlying structure. However we show that slightly simplified versions of the hash functions are surprisingly weak : whenever symmetric constants and initialization values are used throughout the computations, and modular additions are replaced by exclusive or operations, symmetric messages hash to symmetric digests. Therefore the complexity of collision search on these modified hash functions potentially becomes as low as one wishes.read more
Citations
More filters
Proceedings ArticleDOI
Proposal for SZRP protocol with the establishment of the salted SHA-256 Bit HMAC PBKDF2 advance security system in a MANET
TL;DR: This paper proposed a secure hybrid ad hoc routing protocol, called Secure Zone Routing Protocol (SZRP), based on the concept of zone routing protocol (ZRP) with AES (Advanced Encryption System).
Proceedings ArticleDOI
Efficient FPGA Implementation of the SHA-3 Hash Function
Magnus Sundal,Ricardo Chaves +1 more
TL;DR: This work provides an overview of the achievable performance and cost for different folding/unrolling options and solves the intra-round dependencies caused by the θ step-mapping with the pre-computation of values and by improving the memory mapping to reduce the required area resources and obtain shorter datapath.
CRUSH: A New Cryptographic Hash Function Using Iterated Halving Technique
TL;DR: An entirely new approach, based on iterated halving (IH), is proposed for the design of secure and efficient hash functions, allowing a subtle security/performance tradeoff and a direct performance comparison with the existing approach.
Journal Article
Non-randomness of the Full 4 and 5-pass HAVAL
TL;DR: This paper cryptanalyze the compression functions of the 4-pass and the 5-pass HAVAL using differential cryptanalysis and shows that each of these two functions can be distinguished from a truly random function.
Book ChapterDOI
New local collisions for the SHA-2 hash family
TL;DR: In this paper, the authors make a systematic study of local collisions for the SHA-2 family and identify certain impossible conditions for linear approximations of the constituent Boolean functions and compute the probabilities of the various differential paths.
References
More filters
Proceedings Article
The MD5 Message-Digest Algorithm
TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
Book ChapterDOI
A design principle for hash functions
TL;DR: Apart from suggesting a generally sound design principle for hash functions, the results give a unified view of several apparently unrelated constructions of hash functions proposed earlier, and suggests changes to other proposed constructions to make a proof of security potentially easier.
Book ChapterDOI
The MD4 Message-Digest Algorithm
TL;DR: The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit "fingerprint" or "message digest", in such a way that it is (hopefully) computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest.
Book ChapterDOI
RIPEMD-160: A Strengthened Version of RIPEMD
TL;DR: A new version of RIPEMD with a 160-bit result is proposed, as well as a plug-in substitute for RIPEMd with a 128- bit result, and the software performance of several MD4-based algorithms is compared.
Book ChapterDOI
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
TL;DR: In this paper, a formal and quantitative treatment of the 64 most basic hash function constructions considered by Preneel, Govaerts, and Vandewalle is provided.