Abstract
The design of secure compression functions is of vital importance to hash function development. In this paper we consider the problem of combining smaller trusted compression functions to build a larger compression function. This work leads directly to impossibility results on a range of block cipher-based hash function constructions. © 2006 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Peyrin, T., Gilbert, H., Muller, F., & Robshaw, M. (2006). Combining compression functions and block cipher-based hash functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4284 LNCS, pp. 315–331). https://doi.org/10.1007/11935230_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
