Indifferentiability Security of the Fast Widepipe Hash: Breaking the Birthday Barrier

Free registration required

Executive Summary

The main result of the paper is the solution to a longstanding open problem in the hash function literature: to show that an n-bit iterative hash function can achieve both the rate 1 efficiency, and the indifferentiability security bound that is more than n=2 bits. No hash functions, not even the SHA3 finalists, achieve this property. The Fast Widepipe (FWP) hash mode has been proposed by Nandi and Paul in 2010, as a faster variant of the popular Widepipe (WP) construction proposed by Lucks in 2005.

  • Format: PDF
  • Size: 1423.36 KB