A Preimage Attack for 52-Step HAS-160

2009 ◽  
pp. 302-317 ◽  
Author(s):  
Yu Sasaki ◽  
Kazumaro Aoki
Keyword(s):  
Preimage Attack

scholarly journals (Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others

2012 ◽  
pp. 127-145 ◽  
Author(s):  
Shuang Wu ◽  
Dengguo Feng ◽  
Wenling Wu ◽  
Jian Guo ◽  
Le Dong ◽  
...  
Keyword(s):  
Hash Function ◽  
Preimage Attack

scholarly journals A (Second) Preimage Attack on the GOST Hash Function

2008 ◽  
pp. 224-234 ◽  
Author(s):  
Florian Mendel ◽  
Norbert Pramstaller ◽  
Christian Rechberger
Keyword(s):  
Hash Function ◽  
Preimage Attack

scholarly journals Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL

2008 ◽  
pp. 189-206 ◽  
Author(s):  
Eunjin Lee ◽  
Donghoon Chang ◽  
Jongsung Kim ◽  
Jaechul Sung ◽  
Seokhie Hong
Keyword(s):  
Key Recovery ◽  
Preimage Attack ◽  
Key Recovery Attacks

scholarly journals Improved Preimage Attacks on 4-Round Keccak-224/256

2021 ◽  
pp. 217-238
Author(s):  
Le He ◽  
Xiaoen Lin ◽  
Hongbo Yu
Keyword(s):  
Theoretical Analysis ◽  
Degrees Of Freedom ◽  
Linear Structure ◽  
Linearization Method ◽  
Partial Linearization ◽  
Practical Complexity ◽  
Partial Linearization Method ◽  
Preimage Attack

This paper provides an improved preimage attack method on standard 4-round Keccak-224/256. The method is based on the work pioneered by Li and Sun, who design a linear structure of 2-round Keccak-224/256 with 194 degrees of freedom left. By partially linearizing 17 output bits through the last 2 rounds, they finally reach a complexity of 2207/2239 for searching a 4-round preimage. Yet under their strategy, those 17 bits are regarded as independent bits and the linearization costs a great amount of freedom. Inspired by their thoughts, we improve the partial linearization method where multiple output bits can reuse some common degrees of freedom. As a result, the complexity of preimage attack on 4-round Keccak-224/256 can be decreased to 2192/2218, which are both the best known theoretical preimage cryptanalysis so far. To support the theoretical analysis, we apply our strategy to a 64-bit partial preimage attack within practical complexity. It is remarkable that this partial linearization method can be directly applied if a better linear structure with more freedom left is proposed.

Sign in / Sign up

Export Citation Format

Share Document