Results 121 to 130 of about 499 (157)
Some of the next articles are maybe not open access.
Construction of the Initial Structure for Preimage Attack of MD5
2009 International Conference on Computational Intelligence and Security, 2009The construction of the initial structure for preimage attack of MD5 is proposed in this paper. With the help of “divide-and-rule” technique, the successful possibility of the construction is higher than 2-32 . Our construction is based on the MD5 structure, the message modification technique which is improved from Wang’ s. Some related techniques such
Ming Mao, Shaohui Chen, Jin Xu
exaly +2 more sources
Preimage Attack on the Parallel FFT-Hashing Function
2007The parallel FFT-Hashing function was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multipermutation which helps in proving its resistance to collision attacks.
Donghoon Chang +2 more
exaly +2 more sources
A Preimage Attack on Reduced Gimli-Hash
Lecture Notes in Computer Science, 2022Donghoon Chang +2 more
exaly +2 more sources
Improved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grøstl. [PDF]
IACR Cryptol. ePrint Arch., 2012 Grøstl is one of the five finalists in the third round of SHA-3 competition hosted by NIST. In this paper, we use many techniques to improve the pseudo preimage attack on Grøstl hash function, such as subspace preimage attack and guess-and-determine ...
Jian Zou 0002 +3 more
openaire +2 more sources
Preimage Attack on ARIRANG. [PDF]
IACR Cryptol. ePrint Arch., 2009 The hash function ARIRANG is one of the 1st round SHA-3 candidates. In this paper, we present preimage attacks on ARIRANG with step-reduced compression functions. We consider two step-reduced variants of the compression function.
Deukjo Hong, Woo-Hwan Kim, Bonwook Koo
openaire +2 more sources
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 +2 more
exaly +2 more sources
Preimage Attack on Hash Function RIPEMD
Journal of Computer Science and Technology, 2009RIPEMD is a cryptographic hash function devised in the framework of the RIPE project (RACE Integrity Primitives Evaluation, 1988-1992). It consists of two parallel lines, and each line is identical to MD4 except for some internal constants. It has been broken by the collision attack, but no preimage attack was given.
Gaoli Wang, Shaohui Wang
openaire +2 more sources
Preimage Attacks on Reduced DHA-256. [PDF]
IACR Cryptol. ePrint Arch., 2009 DHA-256 (Double Hash Algorithm) was proposed at the Cryptographic Hash Workshop hosted by NIST in November 2005. DHA-256 is a dedicated hash function with output length of 256 bits and 64 steps of operations designed to enhance SHA-256 security.
Jinmin Zhong, Xuejia Lai
openaire +3 more sources
Inverse operation and preimage attack on BioHashing
2009 IEEE Workshop on Computational Intelligence in Biometrics: Theory, Algorithms, and Applications, 2009BioHashing generates a BioCode from a user's biometric features by projecting them onto user-specific random vectors and then discritizes the projection coefficients into zero or one. Since biometric features are distorted by the non-invertible transforms and template matching is performed in a transformed state, it has been claimed that BioHashing is ...
Yongjin Lee, Yunsu Chung, Kiyoung Moon
openaire +1 more source
An improved preimage attack on MD2. [PDF]
IACR Cryptol. ePrint Arch., 2008 This paper describes an improved preimage attack on the cryptographic hash function MD2. The attack has complexity equivalent to about $2^{73}$ evaluations of the MD2 compression function.
Søren S. Thomsen
openaire +2 more sources