Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256

2014 ◽  
pp. 263-283 ◽  
Author(s):  
Hongbo Yu ◽  
Jiazhe Chen ◽  
Xiaoyun Wang
Keyword(s):  
Compression Function ◽  
Collision Attack

scholarly journals Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256

2021 ◽  
pp. 316-336
Author(s):  
Amit Kumar Chauhan ◽  
Abhishek Kumar ◽  
Somitra Kumar Sanadhya
Keyword(s):  
Time Complexity ◽  
Block Length ◽  
Compression Function ◽  
Collision Attack ◽  
Classical Setting ◽  
Quantum Version ◽  
Collision Attacks ◽  
Double Block Length

Recently, Hosoyamada and Sasaki (EUROCRYPT 2020), and Xiaoyang Dong et al. (ASIACRYPT 2020) proposed quantum collision attacks against AES-like hashing modes AES-MMO and AES-MP. Their collision attacks are based on the quantum version of the rebound attack technique exploiting the differential trails whose probabilities are too low to be useful in the classical setting but large enough in the quantum setting. In this work, we present dedicated quantum free-start collision attacks on Hirose’s double block length compression function instantiated with AES-256, namely HCF-AES-256. The best publicly known classical attack against HCF-AES-256 covers up to 9 out of 14 rounds. We present a new 10-round differential trail for HCF-AES-256 with probability 2−160, and use it to find collisions with a quantum version of the rebound attack. Our attack succeeds with a time complexity of 285.11 and requires 216 qRAM in the quantum-attack setting, where an attacker can make only classical queries to the oracle and perform offline computations. We also present a quantum free-start collision attack on HCF-AES-256 with a time complexity of 286.07 which outperforms Chailloux, Naya-Plasencia, and Schrottenloher’s generic quantum collision attack (ASIACRYPT 2017) in a model when large qRAM is not available.

Cryptanalysis of the HaF family of hash functions

2015 ◽  
Vol 52 (2) ◽  
pp. 277-287
Author(s):  
Mateusz Buczek ◽  
Marcin Kontak
Keyword(s):  
Fixed Points ◽  
Hash Functions ◽  
Exhaustive Search ◽  
Short Message ◽  
Compression Function ◽  
Collision Attack ◽  
University Of Technology ◽  
Function Call ◽  
Improved Function

HaF is a family of hash functions developed in Poland at Poznán University of Technology, see [1, 2]. It is a classical Merkle-Damgård construction with the output sizes of 256, 512 or 1024 bits. In this paper we present a collision attack with negligible complexity (collisions can be found without using a computer) for all the members of HaF family. We have also shown that the improved function (without the critical transformation) is still insecure. It is possible to find a preimage for a short message with the complexity lower than the exhaustive search. We are also able to create some fixed points with a complexity of single compression function call.

A new one-bit difference collision attack on HAVAL-128

2012 ◽  
Vol 55 (11) ◽  
pp. 2521-2529 ◽  
Author(s):  
WenYing Zhang ◽  
YanYan Li ◽  
Lei Wu
Keyword(s):  
Collision Attack

Efficient Collision Attack Frameworks for RIPEMD-160

2019 ◽  
pp. 117-149
Author(s):  
Fukang Liu ◽  
Christoph Dobraunig ◽  
Florian Mendel ◽  
Takanori Isobe ◽  
Gaoli Wang ◽  
...  
Keyword(s):  
Collision Attack

scholarly journals A Meaningful MD5 Hash Collision Attack

2006 ◽  
Author(s):  
Narayana D. Kashyap
Keyword(s):  
Collision Attack

scholarly journals Rebound Distinguishers: Results on the Full Whirlpool Compression Function

2009 ◽  
pp. 126-143 ◽  
Author(s):  
Mario Lamberger ◽  
Florian Mendel ◽  
Christian Rechberger ◽  
Vincent Rijmen ◽  
Martin Schläffer
Keyword(s):  
Compression Function
Sign in / Sign up

Export Citation Format

Share Document