It's interesting that 2010/430 and 2010/384 said there's a big trouble with narrow-pipe hash functions.
Forum: 2010 Reports

Applications of surjection round try to thwart the conclusion( Of 2010/384 and 2010/430) on narrow-pipe hash functions.
Forum: 2010 Reports

Danilo, Your are entitled to your opinion. But narrow pipe designs are more efficient, and their security is clearly defined (the discussion on the hash function mailing list can probably explain w
Forum: 2010 Reports

Designers of narrow-pipe hash functions can ignore the facts that those designs are inferior to wide-pipe designs. Its their choice. “Know the enemy and know yourself; in a hundred battles you will
Forum: 2010 Reports

Orr, you mix theory and practice, hash function and compression functions together. We even underlined the difference between hash function calls and compression function calls in the paper.
Forum: 2010 Reports

The authors of 2010/430 claim that finding collisions in a narrow-pipe takes 2^{n/2-k/2} calls for the _hash function_, which is lower than 2^n/2 expected by the birthday bound. However, the collid
Forum: 2010 Reports