Security analysis of constructions combining FIL random oracles

8Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © International Association for Cryptologic Research 2007.

Cite

CITATION STYLE

APA

Seurin, Y., & Peyrin, T. (2007). Security analysis of constructions combining FIL random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4593 LNCS, pp. 119–136). Springer Verlag. https://doi.org/10.1007/978-3-540-74619-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free