Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering
Number Theory
2023-11-15 v3 Cryptography and Security
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.
Keywords
Cite
@article{arxiv.2310.08416,
title = {Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering},
author = {Gabriella Holden and Daniel Shiu and Lauren Strutt},
journal= {arXiv preprint arXiv:2310.08416},
year = {2023}
}
Comments
20 pages, 5 figures