Citations: Presented at the rump session of Eurocrypt

17 citations found. Retrieving documents...

H. Dobbertin. Cryptanalysis of MD5 compress. Presented at the rump session of EUROCRYPT'96, May 1996.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

Bucket Hashing with a Small Key Size - Johansson (1997) (7 citations) (Correct)

.... bucket hashing [22] It is a very efficient way of producing a MAC, ideally requiring only 6 10 simple instruction per word to be authenticated. The drawback of this approach 2 MD5 can probably not be considered to be a cryptographically strong primitive , due to an attack by Dobbertin [9]. 3 In [3] a MAC scheme (XOR MAC) was presented, which is incremental. is the huge key size that is included, which for common parameter choices can be more than a hundred thousand bits. This requires the key to be generated through a pseudo random number generator. As mentioned before, there ....

H. Dobbertin, Cryptoanalysis of MD5 compress, presented at the rump session of EUROCRYPT'96.

RFC2437 RFC.net Page 1 of 40 - Network Working Group (Correct)

....Note. Version 1.5 of this document also allowed for the use of MD4 in signature schemes. The cryptanalysis of MD4 has progressed significantly in the intervening years. For example, Dobbertin [10] demonstrated how to find collisions for MD4 and that the first two rounds of MD4 are not one way [11]. Because of these results and others (e.g. 9] MD4 is no longer recommended. There have also been advances in the cryptanalysis of MD2 and MD5, although not enough to warrant removal from existing applications. Rogier and Chauvaud [19] demonstrated how to find collisions in a modified version ....

H. Dobbertin. Cryptanalysis of MD5 Compress. Presented at the rump session of Eurocrypt `96, May 14, 1996

Unknown - (Correct)

....Note. Version 1.5 of this document also allowed for the use of MD4 in signature schemes. The cryptanalysis of MD4 has progressed significantly in the intervening years. For example, Dobbertin [12] demonstrated how to find collisions for MD4 and that the first two rounds of MD4 are not one way [14]. Because of these results and others (e.g. 11] MD4 is no longer recommended. There have also been advances in the cryptanalysis of MD2 and MD5, although not enough to warrant removal from existing applications. Rogier and Chauvaud [26] demonstrated how to find collisions in a modified version ....

H. Dobbertin. Cryptanalysis of MD5 Compress. Presented at the rump session of Eurocrypt '96, May 14, 1996

On Recent Results for MD2, MD4 and MD5 - Robshaw (1996) (Correct)

....function. If, however, we could identify two message blocks which provide a collision when the pre specified initial value is used, then we would have full collisions for the hash function. At Eurocrypt 96 it was announced that collisions for the compression function of MD5 had been found [9]. In a modification to the techniques used so devastatingly on MD4, Dobbertin demonstrated that collisions for the compression function of MD5 could be found in around 10 hours on a PC. Whereas the pseudo collisions discovered by den Boer and Bosselaers could not be extended to full collisions for ....

....25] Collisions have been demonstrated for MD4 [7, 8] MD4 should not be used. This merely restates a recommendation which has been present in the literature for some time, in fact, its use has not been recommended since the introduction of MD5. MD5 Both pseudo collisions [6] and collisions [9, 10] for the compression function of MD5 have been demonstrated, though collisions for the full MD5 have not yet been achieved. Existing signatures formed using MD5 are not at risk and while MD5 is still suitable for a variety of applications (namely those which rely on the one way property of MD5 ....

H. Dobbertin. Cryptanalysis of MD5 Compress. Presented at the rump session of Eurocrypt `96, May 14, 1996.

Signed Executables for Linux - van Doorn, Ballintijn, Arbaugh (2001) Self-citation (Md) (Correct)

....in the future. It is also useful that it is a well known format with publicly available implementations, allowing us to implement our system quickly. The signature is created using the MD5 secure hash function and the RSA encryption scheme [13] However, given the possible weaknesses of MD5 [4], we expect to use a di erent secure hash algorithm in the future, e.g. SHA1. 3.1 Statically Linked Executables The actual signature veri cation is performed during the execve( system call. During this system call the memory image of the current process is discarded, and a new memory image is ....

H. Dobbertin. Cryptanalysis of MD5 Compress, May 1996. Presented at the rump session of Eurocrypt `96.

SHACAL (- Submission to NESSIE -) - Handschuh, Naccache (2000) (Correct)