arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1201.5273math.COcs.CR
收藏

基于对偶HKZ基的最近点搜索算法的改进

Improvements in closest point search based on dual HKZ-bases

Urs Wagner, Gerard Maze

摘要:

本文回顾了J. Bloemer提出的基于对偶HKZ-基的CVP求解方法。该技术是基于Banaszczyk给出的转移定理,其中隐含了一些必要条件的系数最接近的向量相对于一个基础,其对偶是HKZ减少。递归地,从最后一个系数开始,可以为任何最接近的向量的第i个系数导出长度为i的区间。这导致了n!最接近向量的候选者。本文改进了由迁移定理导出的必要条件,给出了候选数的指数减少。这种改进是由于区间的长度不是独立的。在原始算法中,系数对(a_i,a_{i+1})的候选对应于体积i(i+1)的矩形中的整数点。在我们的分析中,我们表明,(a_i,a_{i+1})的候选人实际上位于一个椭圆的横向和共轭直径i+1,分别为i。这将以指数因子约0.886^n减少要枚举的点的总数。我们进一步展示了如何选择系数(a_n,.,a_{i+1})影响可以从中选择a_i的间隔。数值计算表明,对于10 <= n <= 2000,这些考虑允许限制由n^{0.75 n}枚举的点的数量。假设格中最短非零向量长度的高斯启发式算法是严格的,则该数字甚至可以以2^{-2n} n^{n/2}为界。

英文摘要:

In this paper we review the technique to solve the CVP based on dual HKZ-bases by J. Bloemer. The technique is based on the transference theorems given by Banaszczyk which imply some necessary conditions on the coefficients of the closest vectors with respect to a basis whose dual is HKZ reduced. Recursively, starting with the last coefficient, intervals of length i can be derived for the i-th coefficient of any closest vector. This leads to n! candidates for closest vectors. In this paper we refine the necessary conditions derived from the transference theorems, giving an exponential reduction of the number of candidates. The improvement is due to the fact that the lengths of the intervals are not independent. In the original algorithm the candidates for a coefficient pair (a_i,a_{i+1}) correspond to the integer points in a rectangle of volume i(i+1). In our analysis we show that the candidates for (a_i,a_{i+1}) in fact lie in an ellipse with transverse and conjugate diameter i+1, respectively i. This reduces the overall number of points to be enumerated by an exponential factor of about 0.886^n. We further show how a choice of the coefficients (a_n,...,a_{i+1}) influences the interval from which a_i can be chosen. Numerical computations show that these considerations allow to bound the number of points to be enumerated by n^{0.75 n} for 10 <= n <= 2000. Under the assumption that the Gaussian heuristic for the length of the shortest nonzero vector in a lattice is tight, this number can even be bounded by 2^{-2n} n^{n/2}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑