Collision attack

About: Collision attack is a research topic. Over the lifetime, 1093 publications have been published within this topic receiving 28389 citations.

Improved MD5 through the extension of 1024 Message Input Block

Abstract: MD5 cryptographic hash function is greatly affected by collision vulnerability and as a result dramatically affects not only the security of the message but most importantly the integrity of the data. In this study, a new method for the padding process of the original message was introduced and additional operations on the internal processes are implemented. The result of the computing simulation indicates that the extension of the message block from 512 to 1024-bit blocks and expansion of the length of the resulting value per round from 32 to 64 bits together with added operations increases the security of the modified message digest hash function. An evaluation on the produced hash value has been conducted using the avalanche effect test that resulted to a value of 56.91 and randomness test to assess the randomization value into which a remarkable output of 56.45 and 55.93 respectively has been obtained into which it has considerably been attested that collision concern has been addressed.

Quantum Preimage and Collision Attacks on CubeHash.

Abstract: In this paper we show a quantum preimage attack on CubeHash-512-normal with complexity 2. This kind of attack is expected to cost 2 for a good 512-bit hash function, and we argue that this violates the expected security of CubeHash. The preimage attack can also be used as a collision attack, given that a generic quantum collision attack on a 512-bit hash function require 2 operations, as explained in the CubeHash submission document. This attack only uses very simple techniques, most of which are borrowed from previous analysis of CubeHash: we just combine symmetry based attacks [1,8] with Grover’s algorithm. However, it is arguably the first attack on a second-round SHA-3 candidate that is more efficient than the attacks considered by the designer.

Cryptanalysis of 1-Round KECCAK.

Abstract: In this paper, we give the first pre-image attack against 1-round KECCAK-512 hash function, which works for all variants of 1-round KECCAK. The attack gives a preimage of length less than 1024 bits by solving a system of 384 linear equations. We also give a collision attack against 1-round KECCAK using similar analysis.

An Attack on Two Hash Functions by Zheng-Matsumoto-Imai

Abstract: In [ZMI89, ZMI90] two constructions for a collision resistant hash function were proposed. The first scheme is based on a block cipher, and the second scheme uses modular arithmetic. It is shown in this paper that both proposals have serious weaknesses.