 Date: 2012-12-31 14:07:22Hashing Artificial intelligence Information retrieval Hash function Hash table MD5 Collision Provably secure cryptographic hash function Elliptic curve only hash Cryptographic hash functions Cryptography Search algorithms | |  Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find near-collisions for a hash
Add to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 100,29 KBShare Document on Facebook
|
