Show simple item record

dc.contributor.authorBrockmann, Andrew
dc.date.accessioned2018-08-08T18:51:42Z
dc.date.available2018-08-08T18:51:42Z
dc.date.issued2018-08-08T18:51:42Z
dc.identifier.citationTR1853
dc.identifier.urihttp://digital.library.wisc.edu/1793/78675
dc.description.abstractWe present an explicit formula that produces hash collisions for the Merkle-Damgard construction. The formula works for arbitrary choice of message block and irrespective of the standardized constants used in hash functions, although some padding schemes may cause the formula to fail. This formula bears no obvious practical implications because at least one of any pair of colliding messages will have length double exponential in the security parameter. However, due to ambiguity in existing definitions of collision resistance, this formula arguably breaks the collision resistance of some hash functions.en
dc.language.isoen_USen
dc.relation.ispartofseriestech reports;TR1853
dc.subjecthash functionsen
dc.subjecthash collisionsen
dc.subjectrandom mapping propertiesen
dc.titleA Formula That Generates Hash Collisionsen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record