arXiv · 2310.08416
Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering
Abstract
We introduce and analyse a family of hash and predicate functions that are more likely to produce collisions for small reducible configurations of vectors. These may offer practical improvements to lattice sieving for short vectors. In particular, in one asymptotic regime the family exhibits significantly different convergent behaviour than existing hash functions and predicates.
Explore related subjects
Keep this discovery
Gabriella Holden, Daniel Shiu, Lauren Strutt. 2023-10-12. Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering. https://arxiv.org/abs/2310.08416
Cite the original work for its findings. Save a collection to share your selection of sources.