一种最短向量已知格的生成方法  

A Method for SVK-lattices Generating

作　　者：余位驰[1] 张文芳[1] 何大可[2] 

机构地区：[1]现代通信国家重点实验室 [2]西南交通大学信息安全与国家计算网格实验室,成都610031

出　　处：《计算机工程》2006年第15期19-21,共3页Computer Engineering

基　　金：现代通信国家重点实验室基金资助项目(51436010203QT2201)

摘　　要：提出了最短向量已知格的概念。通过对循环格的分析,得到了循环格是最短向量已知格的两个定理。为了得到随机性更好的最短向量已知格,提出了伪循环格的概念,并且给出了伪循环格是最短向量已知格的充分条件。相关的定理都是构造性的,通过简单的算法就可以快速生成最短向量已知格。最后给出了对格基进行随机化的一般性算法。SVK-lattices, in which the shortest vector in the lattice is known, are proposed for the first time. Several theorems about the relationship between cyclic lattices and SVK-lattices are proved. By these constructive theorems, SVK-lattices can be generated simply. Pseudo-cyclic lattices whose random properties better than cyclic lattices also are investigated for the first time. An algorithm for randomizing SVK-lattices which are obtained by cycle lattices or pseudo- cycle lattices are given at the end of this paper. Some examples are shown in appendix.

关 键 词：最短向量已知格 循环格 伪循环格 格基规约 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]