On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions.
John BlackMartin CochranThomas ShrimptonPublished in: IACR Cryptol. ePrint Arch. (2007)
Keyphrases
- highly efficient
- hash functions
- similarity search
- order preserving
- low cost
- locality sensitive
- hashing algorithm
- locality sensitive hashing
- nearest neighbor search
- hamming distance
- data distribution
- low complexity
- hamming space
- orders of magnitude
- query processing
- computer vision
- pattern matching
- binary codes
- multithreading
- computational complexity
- neural network
- database