Security analysis of constructions combining FIL random oracles

  • Authors:
  • Yannick Seurin;Thomas Peyrin

  • Affiliations:
  • France Telecom R&D, Issy-les-Moulineaux, France and Université de Versailles, Versailles, France;France Telecom R&D, Issy-les-Moulineaux, France and Université de Versailles, Versailles, France

  • Venue:
  • FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the security of compression functions built by combining smaller perfectly secure compression functions modeled as fixed input length random oracles. We give tight security bounds and generic attacks for various parameters of these constructions and apply our results to recent proposals of block cipher-based hash functions.