Finding Collisions for a 45-Step Simplified HAS-V

  title={Finding Collisions for a 45-Step Simplified HAS-V},
  author={Nicky Mouha and Christophe De Canni{\`e}re and Sebastiaan Indesteege and Bart Preneel},
Recent attacks on hash functions start by constructing a differential characteristic. By finding message pairs that satisfy this characteristic, a collision can be found. This paper describes the method of De Cannière and Rechberger to construct generalized characteristics for SHA-1 in more detail. This method is further generalized and applied to a simplified variant of the HAS-V hash function. Using these techniques, a characteristic for 45 steps is found, requiring an effort of about 2… CONTINUE READING
8 Citations
22 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 22 references

MD5 considered harmful today: Creating a rogue CA certificate (December 2008) 25th Chaos Communications Congress, Berlin, Germany

  • A. Sotirov, M. Stevens, +4 authors B. de Weger
  • 2008
Highly Influential
4 Excerpts

Announcing Request for Candidate Algorithm Nominations for a New Cryptographic Hash Algorithm (SHA-3) Family

  • National Institute of Standards, Technology
  • Federal Register 27(212)
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…