Finding collisions for reduced Luffa-256 v2 (poster)

Abstract

This paper presents ongoing work toward analysis of a second round SHA-3 candidate Luffa. This article analyses the collision resistance of reduced-round versions of Luffa-256 v2 which is the 256-bit hash function in the Luffa family. This paper focuses on the hash function security. To the best of our knowledge, this is the first collision analysis for fixed initial vector of Luffa. We show that collisions for 4 out of 8 steps of Luffa-256 v2 can be found with complexity 290 using sophisticated message modification techniques. © 2011 Springer-Verlag.