On the geometry of cyclic lattices (Q464733)

Cyclic lattices are sublattices of \({\mathbb Z}^N\) that are preserved under the rotational shift operator, i.e., the operator that cyclically change basis vectors. In particular, cyclic lattices are of interest due to their applications in cryptography. In this paper the authors prove that a positive proportion of cyclic lattices in every dimension is well-rounded. As a consequence one has that the shortest vectors problem (SVP) is equivalent to the shortest independent vectors problem (SIVP) on a positive proportion of cyclic lattices in every dimension. Additionally the authors generalized these results to another class of sublattices of \({\mathbb Z}^N\) closed under the action of subgroups of the permutation group \(S_N\).