Security Analysis of Constructions Combining FIL Random Oracles

  • Yannick Seurin
  • Thomas Peyrin
Conference paper

DOI: 10.1007/978-3-540-74619-5_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4593)
Cite this paper as:
Seurin Y., Peyrin T. (2007) Security Analysis of Constructions Combining FIL Random Oracles. In: Biryukov A. (eds) Fast Software Encryption. FSE 2007. Lecture Notes in Computer Science, vol 4593. Springer, Berlin, Heidelberg


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.


block ciphers compression functions hash functions provable security random oracle 
Download to read the full conference paper text

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