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.

翻译：我们引入并分析了一类哈希函数与谓词函数族，其对于小型可约向量构型更易产生碰撞。此类函数或可改善格基筛法在短向量搜索中的实际表现。特别地，在某一渐近区域中，该函数族相较于现有哈希函数与谓词呈现出显著不同的收敛行为。