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.

翻译：本文引入并分析了一族哈希与谓词函数，该族函数对较小可约向量构型更易产生碰撞，这有望为短向量格筛算法提供实际性能改进。特别地，在某种渐近机制下，该函数族表现出与现有哈希函数及谓词显著不同的收敛行为。