理想格上格基的快速三角化算法研究

Fast Triangularization of Ideal Latttice Basis

为了提高理想格上格基的三角化算法的效率,该文通过研究理想格上的多项式结构提出了一个理想格上格基的快速三角化算法,其时间复杂度为O(n3log2B),其中n是格基的维数,B是格基的无穷范数。基于该算法,可以得到一个计算理想格上格基Smith标准型的确定算法,且其时间复杂度也比现有的算法要快。更进一步,对于密码学中经常所使用的一类特殊的理想格,可以用更快的算法将三角化矩阵转化为格基的Hermite标准型。

To improve the efficiency of the triangularization of ideal lattice basis,a fast algorithm for triangularizing an ideal lattice basis is proposed by studying the polynomial structure,which runs in time O(n3log2B),where n is the dimension of the lattice,B is the infinity norm of lattice basis.Based on the algorithm,a deterministic algorithm for computing the Smith Normal Form(SNF)of ideal lattice is given,which has the same time complexity and thus is faster than any previously known algorithms.Moreover,for a special class of ideal lattices,a method to transform such triangular bases into Hermite Normal Form(HNF)faster than previous algorithms will be present.