Results 1 to 10 of about 442,051 (179)
Automatic Preimage Attack Framework on Ascon Using a Linearize-and-Guess Approach [PDF]
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 +4 more
doaj +7 more sources
Improved Preimage Attacks on 4-Round Keccak-224/256
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.
Le He, Xiaoen Lin, Hongbo Yu
doaj +3 more sources
Preimage Attacks on Reduced Tiger and SHA-2 [PDF]
This paper shows new preimage attacks on reduced Tiger and SHA-2. Indesteege and Preneel presented a preimage attack on Tiger reduced to 13 rounds (out of 24) with a complexity of 2128.5. Our new preimage attack finds a one-block preimage of Tiger reduced to 16 rounds with a complexity of 2161. The proposed attack is based on meet-in-the-middle attacks.
Takanori Isobe, Kyoji Shibutani
exaly +3 more sources
New Preimage Attacks Against Reduced SHA-1 [PDF]
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.
Dmitry Khovratovich
exaly +3 more sources
A Second Preimage Attack on the XOR Hash Combiner
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 +3 more
doaj +3 more sources
Preimage and collision attacks on reduced Ascon using algebraic strategies
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 +3 more
doaj +2 more sources
Preimage Attacks on 3, 4, and 5-Pass HAVAL [PDF]
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
Kazumaro Aoki
exaly +3 more sources
Quantum Algorithms for Hash Preimage Attacks
Ning Xie, Ping Wang, Zhiwei Sun
exaly +2 more sources
Preimage Attack on BioHashing [PDF]
Biometric recognition is more and more employed in authentication and access control of various applications. Biometric data are strongly linked with the user and do not allow revocability nor diversity, without an adapted post-processing. Cancelable biometrics, including the very popular algorithm BioHashing, is used to cope with the underlying ...
Lacharme, Patrick +2 more
openaire +4 more sources
Improved MITM Cryptanalysis on Streebog
At ASIACRYPT 2012, Sasaki et al. introduced the guess-and-determine approach to extend the meet-in-the-middle (MITM) preimage attack. At CRYPTO 2021, Dong et al.
Jialiang Hua +5 more
doaj +1 more source

