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
Journal ArticleDOI
Democratic learning: hardware/software co-design for lightweight blockchain-secured on-device machine learning
TL;DR: Wang et al. as mentioned in this paper proposed democratic learning (DemL), which makes the first step to explore hardware/software co-design for blockchain-secured decentralized on-device learning.
Dissertation
Analyse de fonctions de hachage cryptographiques
TL;DR: In this paper, the authors present the deux meilleures attaques pratiques connues a ce jour contre SHA-0 and SHA-1 and decrivons the premiere attaque calculant des collisions for la famille de fonctions de hachage GRINDAHL, un nouveau candidat reposant sur des principes de conception assez novateurs.
Proceedings ArticleDOI
Fingerprinting for Web Applications: From Devices to Related Groups
TL;DR: This work devised a related group fingerprinting scheme that is evaluated experimentally with data from hundreds of users and suggests that group fingerprintsing is feasible.
Posted Content
New Local Collisions for the SHA-2 Hash Family.
TL;DR: A systematic study of local collisions for the SHA-2 family, where only one local collision due to Gilbert-Handschuh was known, and a general method for finding local collisions is described.
Posted Content
Instruction Sequence Expressions for the Secure Hash Algorithm SHA-256
TL;DR: This work describes such instruction sequences for the restrictions to bit strings of the different possible lengths by means of uniform terms from an algebraic theory.
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.