Results 11 to 20 of about 442,051 (179)
The Second-Preimage Attack on MD4 [PDF]
Journal of Cryptology, 2005 In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicable to explore the second- preimage of MD4. About the second-preimage attack, they showed that a random message was a weak message with probability 2−122 and it only needed a one ...
Hongbo Yu +3 more
openaire +5 more sources
Preimage and pseudo collision attacks on round-reduced DHA-256 hash function [PDF]
Tongxin xuebao, 2013 A preimage attack on DHA-256 hash function reduced to 37-round and a pseudo collision attack on the func-tion reduced to 39-round were proposed respectively.Based on the meet-in-the-middle attack,the Biclique technique was used to improve the preimage ...
Jian ZOU +3 more
doaj +4 more sources
Preimage and pseudo-collision attacks on 29-step SM3 hash function with padding [PDF]
Tongxin xuebao, 2014 The security of SM3 hash function was revaluated by using the meet-in-the-middle attack. The preimage and pseudo-collision attack on 29-step SM3 hash function (from the 1-st step) with padding was presented.
Gao-li WANG, Yan-zhao SHEN
doaj +4 more sources
Second Preimage Attacks on Dithered Hash Functions [PDF]
, 2008 We develop a new generic long-message second preimage attack, based on combining the techniques in the second preimage attacks of Dean [8] and Kelsey and Schneier [16] with the herding attack of Kelsey and Kohno [15]. We show that these generic attacks apply to hash functions using the Merkle-Damgård construction with only slightly more work than the ...
Elena Andreeva 0001 +6 more
openaire +4 more sources
Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
IACR Transactions on Symmetric Cryptology, 2023 At EUROCRYPT 2006, Kelsey and Kohno proposed the so-called chosen target forced-prefix (CTFP) preimage attack, where for any challenge prefix P, the attacker can generate a suffix S such that H(P∥S) = y for some hash value y published in advance by the ...
Zhiyu Zhang +3 more
doaj +1 more source
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems
IET Information Security, 2023 In this paper, improved preimage attacks are presented on 3‐round Keccak‐256 and Keccak‐512 and 4‐round Keccak‐256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing ...
Junling Pei, Lusheng Chen
doaj +1 more source
Preimage and Collision Attacks on MD2 [PDF]
, 2005 This paper contains several attacks on the hash function MD2 which has a hash code size of 128 bits. At Asiacrypt 2004 Muller presents the first known preimage attack on MD2. The time complexity of the attack is about 2104 and the preimages consist always of 128 blocks.
Lars R. Knudsen, John Erik Mathiassen
openaire +2 more sources
A preimage attack on reduced GIMLI‐HASH with unbalanced squeezing phase
IET Information Security, 2023 In Conference on Cryptographic Hardware and Embedded System 2017, Bernstein et al. proposed GIMLI, a 384‐bit permutation with 24 rounds, which aims to provide high performance on various platforms.
Yongseong Lee +3 more
doaj +1 more source
Preimage Attacks on Reduced-Round Stribog [PDF]
, 2014 In August 2012, the Stribog hash function was selected as the new Russian cryptographic hash standard (GOST R 34.11-2012). Stribog employs twelve rounds of an AES-based compression function operating in Miyaguchi-Preneel mode. In this paper, we investigate the preimage resistance of the Stribog hash function.
Riham AlTawy, Amr M. Youssef
openaire +3 more sources
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
IACR Transactions on Symmetric Cryptology, 2020 Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes.
Zhenzhen Bao +4 more
doaj +1 more source