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
Book ChapterDOI
Fostering Open Data Using Blockchain Technology
Simon Tschirner,Mathias Röper,Katharina Zeuch,Markus M. Becker,Laura Vilardell Scholten,Volker Skwarek +5 more
TL;DR: The QPTDat project as mentioned in this paper aims to increase the incentives to publish, share, and reuse research data, following FAIR principles and fostering the idea of open data by providing a secure proof of authorship to guarantee that they are credited for their work; a proof of data integrity, to ensure that reused data has not been modified or fabricated; and comprehensive reputation management, to give an additional incentive to share research data.
Proceedings ArticleDOI
Mining the web with webcoin
TL;DR: It is shown how complex networking-intensive tasks can be crowdsourced using Bitcoin's incentive model, and Webcoin is presented, a novel distributed digital-currency which utilizes networking resources rather then computational, and can only be mined through Web indexing.
Mise en oeuvre de nouvelles techniques pour la sécurité informatique basées sur les algorithmes évolutionnistes et les fonctions de Hachage
TL;DR: A new encryption system whose internal structure is essentially based on Tabu search is designed and the application of memetic algorithm, which is a hybrid metaheuristic combining an evolutionary algorithm and a local search method for solving a scheduling problem in the domain of symmetric cryptography is addressed.
Dissertation
Contributions to the security of mobile agent systems
TL;DR: L’informatique distribuee a connu une grande evolution en raison de l’utilisation du paradigme des agents mobiles, dote d’innovantes capacites, au lieu du systeme client-serveur ou les applications sont liees a des nœuds particuliers dans les reseaux.
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.