Results 11 to 20 of about 4,920 (187)

A Second Preimage Attack on the XOR Hash Combiner [PDF]

IET Information Security
The exclusive-or (XOR) hash combiner is a classical hash function combiner, which is well known as a good PRF and MAC combiner, and is used in practice in TLS versions 1.0 and 1.1.
Shiwei Chen, Ting Cui, Chenhui Jin, Congjun Wang   +3 more
doaj   +3 more sources

Automatic Preimage Attack Framework on Ascon Using a Linearize-and-Guess Approach

IACR Transactions on Symmetric Cryptology, 2023
Ascon is the final winner of the lightweight cryptography standardization competition (2018 − 2023). In this paper, we focus on preimage attacks against round-reduced Ascon.
Huina Li, Le He, Shiyao Chen, Jian Guo, Weidong Qiu   +4 more
doaj   +3 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, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer   +6 more
openalex   +4 more sources

New Second-Preimage Attacks on Hash Functions [PDF]

Journal of Cryptology, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elena Andreeva, Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer   +7 more
  +7 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, Yao Sun, Maodong Liao, Dingkang Wang   +3 more
doaj   +4 more sources

Exploiting Weak Diffusion of Gimli: Improved Distinguishers and Preimage Attacks

IACR Transactions on Symmetric Cryptology, 2021
The Gimli permutation proposed in CHES 2017 was designed for cross-platform performance. One main strategy to achieve such a goal is to utilize a sparse linear layer (Small-Swap and Big-Swap), which occurs every two rounds.
Fukang Liu, Takanori Isobe, Willi Meier
doaj   +3 more sources

Preimage and collision attacks on reduced Ascon using algebraic strategies [PDF]

Cybersecurity
Ascon, a family of algorithms that supports hashing and authenticated encryption, is the winner of the NIST Lightweight Cryptography Project. In this paper, we propose an improved preimage attack against 2-round Ascon-XOF-64 with a complexity of $$2^{33}$
Qinggan Fu, Ye Luo, Qianqian Yang, Ling Song   +3 more
doaj   +2 more sources

A (Second) Preimage Attack on the GOST Hash Function [PDF]

, 2008
In this article, we analyze the security of the GOST hash function with respect to (second) preimage resistance. The GOST hash function, defined in the Russian standard GOST-R 34.11-94, is an iterated hash function producing a 256-bit hash value. As opposed to most commonly used hash functions such as MD5 and SHA-1, the GOST hash function defines, in ...
Florian Mendel, Norbert Pramstaller, Christian Rechberger   +2 more
openalex   +4 more sources

Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160]

IACR Transactions on Symmetric Cryptology
Recently, linear structures and algebraic attacks have been widely used in preimage attacks on round-reduced Keccak. Inherited by pioneers’ work, we make some improvements for 3-round Keccak-256 and 4-round Keccak[r=640, c=160].
Xiaoen Lin, Le He, Hongbo Yu
doaj   +3 more sources

SAT-based preimage attacks on SHA-1

, 2012
Hash functions are important cryptographic primitives which map arbitrarily long messages to fixed-length message digests in such a way that: (1) it is easy to compute the message digest given a message, while (2) inverting the hashing process (e.g. finding a message that maps to a specific message digest) is hard. One attack against a hash function is
Vegard Nossum
openalex   +2 more sources