Results 31 to 40 of about 4,088 (185)
Improved preimage and pseudo-collision attacks on SM3 hash function
Tongxin xuebao, 2018 A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known ...
Jian ZOU, Le DONG
doaj +2 more sources
IACR Transactions on Symmetric Cryptology, 2016 In this paper, we describe attacks on the recently proposed Haraka hash functions. First, for the two hash functions Haraka-256/256 and Haraka-512/256 in the family, we show how two colliding messages can be constructed in about 216 function ...
Jérémy Jean
doaj +1 more source
IEEE Access, 2022 In modern cryptography, hash functions are considered as one of the key components for secure communication. They play a vital role in a wide range of applications such as ensuring the authentication and integrity of the data, in forensic investigation ...
Darshana Upadhyay +3 more
doaj +1 more source
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 ...
Andreeva, Elena +6 more
openaire +3 more sources
The Random Oracle Methodology, Revisited [PDF]
, 2000 We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".
Canetti, Ran +2 more
core +6 more sources
New Preimage Attacks against Reduced SHA-1 [PDF]
, 2012 This paper shows preimage attacks against reduced SHA-1 up to 57 steps. The best previous attack has been presented at CRYPTO 2009 and was for 48 steps finding a two-block preimage with incorrect padding at the cost of $$2^{159.3}$$ evaluations of the compression function.
Simon Knellwolf, Dmitry Khovratovich
openaire +1 more source
Differential-Aided Preimage Attacks On Round-Reduced Keccak
The Computer Journal, 2022 Abstract At FSE 2008, Leurent introduced the preimage attack on MD4 by exploiting differential trails. In this paper, we apply the differential-aided preimage attack to Keccak with the message modification techniques. Instead of directly finding the preimage, we exploit differential characteristics to modify the messages, so that the ...
Congming Wei +4 more
openaire +1 more source
Preimage and pseudo collision attacks on round-reduced DHA-256 hash function
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 +2 more sources
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures
IACR Transactions on Symmetric Cryptology, 2017 In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li +3 more
doaj +1 more source
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source