On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields

被引:0
|
作者
Porter, Christian [1 ]
Lyu, Shanxiang [2 ]
Ling, Cong [1 ]
机构
[1] Imperial Coll London, Dept EEE, London SW7 2AZ, England
[2] Jinan Univ, Coll Cyber Secur, Guangzhou 510632, Peoples R China
关键词
LATTICES; INTEGERS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the algebraic variant of Gauss's algorithm returns a basis that corresponds to the successive minima of the lattice in polynomial time if the chosen ring is Euclidean.
引用
收藏
页码:185 / 189
页数:5
相关论文
共 50 条