Results 1 to 10 of about 215 (141)

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, Jinkeon Kang, Donghoon Chang, Seokhie Hong   +3 more
doaj   +2 more sources

Preimage Attack on 23-Step Tiger

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
This paper evaluates the preimage resistance of the Tiger hash function. To our best knowledge, the maximum number of the attacked steps is 17 among previous preimage attacks on Tiger, where the full version has 24 steps. Our attack will extend the number of the attacked steps to 23.
WANG, Lei, SASAKI, Yu
exaly   +2 more sources

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

Lecture Notes in Computer Science, 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 ...
Christian Rechberger, Mendel Florian, Rechberger Christian   +2 more
exaly   +3 more sources

Improved preimage attack on one-block MD4 [PDF]

Journal of Systems and Software, 2012
MD4 is a hash function designed by Rivest in 1990. The design philosophy of many important hash functions, such as MD5, SHA-1 and SHA-2, originated from that of MD4. We propose an improved preimage attack on one-block MD4 with the time complexity 2^9^5 MD4 compression function operations, as compared to the 2^1^0^7 complexity of the previous attack by ...
Xuejia Lai
exaly   +3 more sources

Preimage Attacks on Reduced Tiger and SHA-2 [PDF]

Lecture Notes in Computer Science, 2009
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, Isobe Takanori, Shibutani Kyoji   +2 more
exaly   +2 more sources

A Second Preimage Attack on the XOR Hash Combiner

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   +2 more sources

Preimage Attack on BioHashing [PDF]

Proceedings of the 10th International Conference on Security and Cryptography, 2013
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, Cherrier, Estelle, Rosenberger, Christophe   +2 more
openaire   +4 more sources

Improved MITM Cryptanalysis on Streebog

IACR Transactions on Symmetric Cryptology, 2022
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, Xiaoyang Dong, Siwei Sun, Zhiyu Zhang, Lei Hu, Xiaoyun Wang   +5 more
doaj   +1 more source

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   +1 more source

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, Gaoli Wang, Guoyan Zhang, Xiaoyun Wang 0001   +3 more
openaire   +4 more sources