Parallelizing message schedules to accelerate the computations of hash functions.
Shay GueronVlad KrasnovPublished in: J. Cryptogr. Eng. (2012)
Keyphrases
- hash functions
- similarity search
- order preserving
- hashing algorithm
- locality sensitive
- approximate nearest neighbor search
- scheduling problem
- random projections
- parallel processing
- locality sensitive hashing
- data distribution
- nearest neighbor search
- hamming distance
- hash table
- encryption scheme
- secret key
- distributed memory
- minimal perfect hash functions
- binary codes
- signature scheme
- multi dimensional