Heuristic Algorithm for Solving Restricted SVP and Its Applications

Download PDF
Open Webpage

Geng Wang, Wenwen Xia, Dawu Gu

Published: 2025, Last Modified: 21 Jan 2026PQCrypto (2) 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In lattice-based cryptography, many attacks are performed by finding a short enough vector on a specific lattice. However, it is possible that length is not the only restriction on the vector to be found. A typical example is SVP with infinity norm: since most SVP solving algorithms only aim to find short vector under Euclidean norm, the infinity norm is in fact another restriction on the vector. In the literature, such problems are usually solved by performing exhaustive search on a list of short vectors generated from lattice sieving. However, the sieving list might either be too large or too small to pass the additional restriction, which makes the solving algorithm inefficient in some cases.