Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering

Autor:	Holden, Gabriella, Shiu, Daniel, Strutt, Lauren
Rok vydání:	2023
Předmět:	Mathematics - Number Theory Computer Science - Cryptography and Security
Druh dokumentu:	Working Paper
Popis:	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. Comment: 20 pages, 5 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2310.08416 Zobrazit plný text záznamu View this record from Arxiv