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
Computation and Communication Evaluation of an Authentication Mechanism for Time-Triggered Networked Control Systems
TL;DR: This paper presents a comprehensive analysis and evaluation of the effects of adding a Hash-based Message Authentication (HMAC) to TT networked control systems and shows that it is feasible to implement a secure communication mechanism without interfering with the existing automotive controller execution times.
Book ChapterDOI
Event Invitations in Privacy-Preserving DOSNs
TL;DR: This research presents a novel approach to avoid the massive collection of sensitive data of all users at a central point is a decentralized architecture.
Dissertation
Market Design for Agricultural Trade in Developing Countries
TL;DR: In this article, the authors present an agent-mediated systeem ontwikkeld in the context of the B2C markt via telecommunicatiediensten.
Proceedings ArticleDOI
Secure publish-subscribe mediated virtual organizations
TL;DR: This article considers a virtual organization architecture, in which subscribers dynamically join and leave various organizations, and presents a new solution which is based on cryptographic hashes and public-key cryptography.
Journal ArticleDOI
IOT Perception Layer Security and Privacy
TL;DR: The purpose of this paper is to study the various security algorithms to achieve security standards (confidentiality, integrity, privacy) on the perception layer of IOT by comparing the different characteristics of these algorithms.
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.