Abstract
This paper advocates a new hash function family based on the HAIFA framework, inheriting built-in randomized hashing and higher security guarantees than the Merkle-Damgård construction against generic attacks. The family has as its special design features: a nested feedforward mechanism and an internal wide-pipe construction within the compression function. As examples, we give two proposed instances that compute 256- and 512-bit digests, with a 8- and 10-round compression function respectively. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Aumasson, J. P., Meier, W., & Phan, R. C. W. (2008). The Hash function family LAKE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5086 LNCS, pp. 36–53). Springer Verlag. https://doi.org/10.1007/978-3-540-71039-4_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
