Finding collisions for reduced Luffa-256 v2

Authors:
Bart Preneel;Hirotaka Yoshida;Dai Watanabe
Affiliations:
Katholieke Universiteit Leuven, Dept. ESAT, SCD-COSIC, Heverlee, Belgium and Interdisciplinary Institute for BroadBand Technology, Belgium;Yokohama Research Laboratory, Hitachi, Ltd, Yokohama-shi, Kanagawa-ken, Japan and Katholieke Universiteit Leuven, Dept. ESAT, SCD-COSIC, Heverlee, Belgium and Interdisciplinary Institute for Broad ...;Yokohama Research Laboratory, Hitachi, Ltd, Yokohama-shi, Kanagawa-ken, Japan
Venue:
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Year:
2011

Citing 4
Cited 0

On the indifferentiability of the sponge construction

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Higher order differential attack on step-reduced variants of Luffa v1

FSE'10 Proceedings of the 17th international conference on Fast software encryption
Cryptanalysis of Luffa v2 components

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.