Difference between revisions of "MD4"
From The ECRYPT Hash Function Website
(→Collision Attacks) |
|||
Line 21: | Line 21: | ||
=== Collision Attacks === | === Collision Attacks === | ||
− | + | <bibtex> | |
+ | @inproceedings{fseVaudenay94, | ||
+ | owner = {tnad}, | ||
+ | author = {Serge Vaudenay}, | ||
+ | title = {On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER}, | ||
+ | pages = {286-297}, | ||
+ | editor = {Bart Preneel}, | ||
+ | booktitle = {FSE}, | ||
+ | publisher = {Springer}, | ||
+ | series = {LNCS}, | ||
+ | volume = {1008}, | ||
+ | year = {1995}, | ||
+ | abstract = {Cryptographic primitives are usually based on a network with boxes. | ||
+ | At EUROCRYPT'94, Schnorr and the author of this paper claimed that | ||
+ | all boxes should be multipermutations. Here, we investigate a few | ||
+ | combinatorial properties of multipermutations. We argue that boxes which | ||
+ | fail to be multipermutations can open the way to unsuspected attacks. | ||
+ | We illustrate this statement with two examples. Firstly, | ||
+ | we show how to construct collisions to MD4 restricted to | ||
+ | its first two rounds. This allows one to forge digests close | ||
+ | to each other using the full compression function of MD4. Secondly, | ||
+ | we show that variants of SAFER are subject to attack faster than | ||
+ | exhaustive search in 6.1% cases. This attack can be implemented if | ||
+ | we decrease the number of rounds from 6 to 4.}, | ||
+ | url = {http://dx.doi.org/10.1007/3-540-60590-8_22} | ||
+ | } | ||
+ | </bibtex> | ||
---- | ---- | ||
Revision as of 14:59, 10 March 2008
Contents
1 Spezification
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
Serge Vaudenay - On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER
- FSE 1008:286-297,1995
- http://dx.doi.org/10.1007/3-540-60590-8_22
BibtexAuthor : Serge Vaudenay
Title : On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER
In : FSE -
Address :
Date : 1995