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.

翻译：我们引入并分析了一族哈希函数和谓词函数，该族函数对小规模可约化向量配置具有更高的碰撞概率。这类方法可能为短向量格筛算法带来实践改进。特别地，在某种渐近条件下，该函数族展现出与现有哈希函数及谓词显著不同的收敛行为。