International Workshop on Fast Software Encryption

FSE 2007: Fast Software Encryption pp 119-136

Security Analysis of Constructions Combining FIL Random Oracles

  • Yannick Seurin
  • Thomas Peyrin
Conference paper

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

Volume 4593 of the book series Lecture Notes in Computer Science (LNCS)

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 cipherscompression functionshash functionsprovable securityrandom 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