![Hashing / Search algorithms / Hash function / Preimage attack / SHA-1 / Collision attack / HMAC / SHA-2 / Merkle–Damgård construction / Cryptographic hash functions / Cryptography / Error detection and correction Hashing / Search algorithms / Hash function / Preimage attack / SHA-1 / Collision attack / HMAC / SHA-2 / Merkle–Damgård construction / Cryptographic hash functions / Cryptography / Error detection and correction](https://www.pdfsearch.io/img/bfae121e01677c329eb28f0319597ecd.jpg) Date: 2010-08-04 14:03:01Hashing Search algorithms Hash function Preimage attack SHA-1 Collision attack HMAC SHA-2 Merkle–Damgård construction Cryptographic hash functions Cryptography Error detection and correction | | Generic collision attacks on narrow-pipe hash functions faster than birthday paradox, applicable to MDx, SHA-1, SHA-2, and SHA-3 narrow-pipe candidates Vlastimil Klima1 and Danilo Gligoroski2 1Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 104,24 KBShare Document on Facebook
|