Results 51 to 60 of about 499 (157)
(pseudo) preimage attack on round-reduced grstl hash function and others
, 2012 The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function.
Feng Dengguo +5 more
core
Preimage Attacks on 3, 4, and 5-Pass HAVAL [PDF]
, 2008 This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2225, a preimage attack on 4-pass HAVAL at the complexity of 2241, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2241. Moreover, we
Yu Sasaki 0001, Kazumaro Aoki
openaire +1 more source
Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings [PDF]
, 2012 We extend and improve biclique attacks, which were recently introduced for the cryptanalysis of block ciphers and hash functions. While previous attacks required a primitive to have a key or a message schedule, we show how to mount attacks on the primitives with these parameters fixed, i.e. on permutations. We introduce the concept of sliced bicliques,
openaire +2 more sources
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners [PDF]
, 2017 This paper studies functional-graph-based (second) preimage attacks against hash combiners. By exploiting more properties of cyclic nodes of functional graph, we find an improved preimage attack against the XOR combiner with a complexity of $2^{5n/8 ...
Zhenzhen Bao +3 more
core
Practical (second) preimage attacks on the TCS_SHA-3 family of cryptographic hash functions
, 2016 TCS_SHA-3 is a family of four cryptographic hash functions that are covered by a United States patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits.
Bhattacharya, Soumyadeep, Sekar, Gautham
core +1 more source
Preimage attacks on the round-reduced Keccak with the aid of differential cryptanalysis [PDF]
, 2013 In this paper we use differential cryptanalysis to attack the winner of the SHA-3 competition, namely Keccak hash function. Despite more than 6 years of intensive cryptanalysis there have been known only two preimage attacks which reach 3 (or slightly ...
Josef Pieprzyk +3 more
core
Post-Quantum Secure Identity-Based Proxy Blind Signature Scheme on a Lattice. [PDF]
Entropy (Basel), 2023 Li F, Yang M, Song Z, Wang P, Li G.
europepmc +1 more source
preimage attacks on step-reduced sm3 hash function
, 2012 This paper proposes a preimage attack on SM3 hash function reduced to 30 steps. SM3 is an iterated hash function based on the Merkle-Damga˚rd design.
Su Bozhan +4 more
core
Second-Preimage Analysis of Reduced SHA-1
, 2010 Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-1 continues to be recommended in all applications except digital signatures ...
Christian Rechberger +1 more
core +1 more source
On the Complexity of Khovratovich et.al\u27s Preimage Attack on Edon-R
, 2009 Based on the analysis made by van Oorschot and Wiener for the complexity of parallel memoryless collision search, we show that the memoryless meet-in-the-middle attack which is one part of the whole preimage attack of Khovratovich et. al.
Rune Steinsmo Ødegård +1 more
core