Sieving for shortest vectors in lattices using angular locality-sensitive hashing.

Thijs Laarhoven

Published in: IACR Cryptol. ePrint Arch. (2014)

Keyphrases

locality sensitive hashing
similarity search
nearest neighbor
nearest neighbor search
brute force
binary codes
hash functions

knn
vector space
approximate nearest neighbor
space efficient
sift features
metric space
range queries

shortest path
neural network
indexing techniques
hamming distance
feature vectors
hash tables

euclidean distance
high dimensional
feature space
search algorithm
hashing methods
data sets