Sciweavers

ICISC
2007

Colliding Message Pair for 53-Step HAS-160

13 years 5 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho et al. presented at ICISC 2006. In this article, we improve their attack complexity by a factor of about 220 using a slightly different strategy for message modification in the first 20 steps of the hash function.
Florian Mendel, Vincent Rijmen
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where ICISC
Authors Florian Mendel, Vincent Rijmen
Comments (0)