Security Analysis of Constructions Combining FIL Random Oracles

  • Yannick Seurin
  • Thomas Peyrin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4593)

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 

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Yannick Seurin
    • 1
  • Thomas Peyrin
    • 1
  1. 1.France 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 VersaillesFrance

Personalised recommendations