On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions.
John BlackMartin CochranThomas ShrimptonPublished in: IACR Cryptol. ePrint Arch. (2004)
Keyphrases
- highly efficient
- hash functions
- similarity search
- locality sensitive
- order preserving
- low cost
- hashing algorithm
- locality sensitive hashing
- low complexity
- data distribution
- hamming distance
- secret key
- hashing methods
- nearest neighbor search
- hamming space
- databases
- minimal perfect hash functions
- block cipher
- nearest neighbor
- high dimensional