Parallelizing message schedules to accelerate the computations of hash functions.
Shay GueronVlad KrasnovPublished in: IACR Cryptol. ePrint Arch. (2012)
Keyphrases
- hash functions
- locality sensitive
- similarity search
- scheduling problem
- approximate nearest neighbor search
- locality sensitive hashing
- hashing algorithm
- random projections
- hamming distance
- order preserving
- parallel processing
- data distribution
- block cipher
- nearest neighbor search
- encryption scheme
- hash table
- stream cipher
- approximate similarity search
- high dimensional
- pattern recognition
- similarity measure
- databases
- data sets