Chapter

Fast Software Encryption

Volume 4593 of the series Lecture Notes in Computer Science pp 119-136

Security Analysis of Constructions Combining FIL Random Oracles

  • Yannick SeurinAffiliated withFrance Telecom R&D, 38-40 rue du Général Leclerc, F-92794 Issy-les-Moulineaux, France, Université de Versailles, 45 avenue des Etats-Unis, F-78035 Versailles
  • , Thomas PeyrinAffiliated withFrance Telecom R&D, 38-40 rue du Général Leclerc, F-92794 Issy-les-Moulineaux, France, Université de Versailles, 45 avenue des Etats-Unis, F-78035 Versailles

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.

Keywords

block ciphers compression functions hash functions provable security random oracle