loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
Constructing SVK_Lattices from Cyclic Bases
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
ASCII Text
x 
 
Weichi Yu, Yu Zheng, Dake He, "Constructing SVK_Lattices from Cyclic Bases," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 997-1001, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.106,
author = {Weichi Yu and Yu Zheng and Dake He},
title = {Constructing SVK_Lattices from Cyclic Bases},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {997-1001},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.106},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - Constructing SVK_Lattices from Cyclic Bases
SN - 0-7695-2405-2
SP997
EP1001
A1 - Weichi Yu,
A1 - Yu Zheng,
A1 - Dake He,
PY - 2005
KW - SVK-lattice
KW - Cyclic Lattice
KW - Pseudo-cyclic Lattice
KW - Lattice Reduction
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
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
Usage of this product signifies your acceptance of the Terms of Use.