Results 141 to 150 of about 416,985 (179)

Preimage Attack on the Parallel FFT-Hashing Function

2007
The 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.
Seokhie Hong, Jaechul Sung, Donghoon Chang   +2 more
exaly   +3 more sources

A Preimage Attack on Reduced Gimli-Hash

Lecture Notes in Computer Science, 2022
Seokhie Hong
exaly   +3 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, Wenling Wu, Shuang Wu 0004, Le Dong   +3 more
core   +3 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
core   +3 more sources

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-Damgard design. It is a hash function used in applications such as the electronic certification service system in China. Our cryptanalysis is based on the Meet-in-the-Middle (MITM) attack.
Jian Zou 0002, Wenling Wu, Shuang Wu 0004, Bozhan Su, Le Dong   +4 more
core   +3 more sources

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
core   +3 more sources

New Preimage Attack on MDC-4. [PDF]

IACR Cryptol. ePrint Arch., 2012
In this paper, we provide some cryptanalytic results for double-block-length (DBL) hash modes of block ciphers, MDC-4. Our preimage attacks follow the framework of Knudsen et al.\u27s time/memory trade-off preimage attack on MDC-2.
Deukjo Hong, Daesung Kwon
core   +3 more sources

Preimage Attack on Hash Function RIPEMD

Journal of Computer Science and Technology, 2009
RIPEMD 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   +4 more sources

Inverse operation and preimage attack on BioHashing

2009 IEEE Workshop on Computational Intelligence in Biometrics: Theory, Algorithms, and Applications, 2009
BioHashing 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

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
core   +4 more sources