FSE
2008
Springer
14 years 1 months ago
2008
Springer
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
FSE
1993
Springer
14 years 3 months ago
1993
Springer
Parallel FFT-Hashing 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 m...
FSE
2005
Springer
14 years 5 months ago
2005
Springer
This paper contains several attacks on the hash function MD2 which has a hash code size of 128 bits. At Asiacrypt 2004 Muller presents the first known preimage attack on MD2. The ...
INDOCRYPT
2009
Springer
14 years 6 months ago
2009
Springer
We present a second preimage attack on SHAMATA-512, which is a hash function of 512bit output and one of the first round candidates of the SHA-3 competition. The attack uses di...
ASIACRYPT
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In this paper, we present a preimage attack for 42 step