To solve hard problems in lattices is a crucial topic in lattice-based cryptanalysis, where the Shortest Vector Problem (SVP) is one of the most famous lattice problems. Recently, there are two kinds ...