Paper 2007/409
Building a Collision-Resistant Compression Function from Non-Compressing Primitives
Thomas Shrimpton and Martijn Stam
Abstract
We consider how to build an efficient compression function from a small number of random, non-compressing primitives.
Our main goal is to achieve a level of collision resistance as close as possible to the optimal birthday bound. We present a
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Full version of paper appearing at ICALP'08
- Keywords
- Hash FunctionsRandom Oracle ModelCompression FunctionsCollision Resistance
- Contact author(s)
- martijn stam @ epfl ch
- History
- 2008-07-06: last of 2 revisions
- 2007-10-26: received
- See all versions
- Short URL
- https://ia.cr/2007/409
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/409, author = {Thomas Shrimpton and Martijn Stam}, title = {Building a Collision-Resistant Compression Function from Non-Compressing Primitives}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/409}, year = {2007}, url = {https://eprint.iacr.org/2007/409} }