On the indifferentiability of fugue and luffa

Authors:
Rishiraj Bhattacharyya;Avradip Mandal
Affiliations:
Cryptology Research Group, Applied Statistics Unit, Indian Statistical Institute, Kolkata;Université du Luxembourg, Luxembourg
Venue:
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Year:
2011

Citing 8
Cited 0

The random oracle methodology, revisited

Journal of the ACM (JACM)
Improved Indifferentiability Security Analysis of chopMD Hash Function

Fast Software Encryption
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
Security analysis of the mode of JH hash function

FSE'10 Proceedings of the 17th international conference on Fast software encryption
On the indifferentiability of the Grøstl hash function

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Indifferentiable security analysis of popular hash functions with prefix-free padding

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
A simple and unified method of proving indistinguishability

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Merkle-Damgård revisited: how to construct a hash function

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Indifferentiability is currently considered to be an important security notion for a cryptographic hash function to instantiate Random Oracles in different security proofs. In this paper, we prove indifferentiability of Fugue and Luffa, two SHA3 second round candidates. We also analyze the indifferentiability of a modified Luffa mode replacing multiple small permutations by a single large permutation. Our technique is quite general and can be applicable to any sponge based design which uses affine function for message insertion. To the best of our knowledge, our result for Luffa is the first indifferentiability analysis of a mode of operation based on variable (more than two) number of small permutations.