\(\mathbb {Z}^n\) is one of the simplest types of lattices, but the computational problems on its rotations, such as \(\mathbb {Z}\) SVP and \(\mathbb {Z}\) LIP, have been of great interest in cryptography. Recent advances have been made in building cryptographic primitives based on these problems, as well as in developing new algorithms for solving them. However, the theoretical complexity of \(\mathbb {Z}\) SVP and \(\mathbb {Z}\) LIP is still not well understood. In this work, we study the problems on rotations of \(\mathbb {Z}^n\) by exploiting the symmetry property. We introduce a randomization framework that can be roughly viewed as ‘applying random automorphisms’ to the output of an oracle, without accessing the automorphism group. Using this framework, we obtain new reduction results for rotations of \(\mathbb {Z}^n\) . First, we present a reduction from \(\mathbb {Z}\) LIP to \(\mathbb {Z}\) SCVP. Here \(\mathbb {Z}\) SCVP is the problem of finding the shortest characteristic vectors, which is a special case of CVP where the target vector is a deep hole of the lattice. Moreover, we prove a reduction from \(\mathbb {Z}\) SVP to \(\gamma \) - \(\mathbb {Z}\) SVP for any constant \(\gamma = O(1)\) in the same dimension, which implies that \(\mathbb {Z}\) SVP is as hard as its approximate version for any constant approximation factor. Second, we investigate the problem of finding a nontrivial automorphism for a given lattice, which is called LAP. Specifically, we use the randomization framework to show that \(\mathbb {Z}\) LAP is as hard as \(\mathbb {Z}\) LIP. Additionally, we demonstrate that the randomization framework is also applicable to other lattices exhibiting high-degree symmetry, and prove that the isomorphism and automorphism problems related to \(D_n\) are as hard as \(\mathbb {Z}\) LIP.
