Weichi Yu, School of Information Science and Technology, Southwest Jiaotong University, Chengdu, 6China
Yu Zheng, School of Information Science and Technology, Southwest Jiaotong University, Chengdu, 6China
Dake He, Research Center for Secure Application in Network and Communications Southwest Jiaotong University, Chengdu, China
SVK-lattices, in which the shortest vector is known, are proposed for the first time. Two theorems on the relationship between cyclic lattices and SVK-lattices are proposed and proved. By these constructive theorems, SVK-lattices can be simply generated. Pseudo-cyclic lattices, whose random properties are better than cyclic lattice, are also investigated for the first time. Two algorithms are designed for generating random SVK-lattices from pseudo-cyclic lattices. A general algorithm for randomizing a lattice basis is presented at the end of this paper.
Index Terms:
SVK-lattice, Cyclic Lattice, Pseudo-cyclic Lattice, Lattice Reduction
Citation:
Weichi Yu, Yu Zheng, Dake He, "Constructing SVK_Lattices from Cyclic Bases," pdcat, pp.997-1001, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb