Provably Subexponential Algorithms for Bounded-Error LWE with Few Samples

We show that a variant of the Wagner/BKW-style algorithm for LWE of Kirchner and Fouque [KF15] solves decision and search LWE with secrets of size n over prime moduli q=n κ+o(1), for any fixed κ>0, with errors bounded by ((n) o(1)), in time 2 O(n/ n) given n+O(n/ n) original samples. Further, if each coordinate of the secret is also bounded by ((n) o(1)), the same time bound holds with errors bounded by n o(1) and only O(n/ q) samples. Earlier, it was known that Kirchner and Fouque's algorithm could solve LWE with these parameters in subexponential time with a much larger number of samples m = Ω(n) [HKM18]. Ducas et al. [DEL25] showed that an adaptation of this algorithm could solve the corresponding dual, the SIS infinity problem, with a suitable norm bound q/polylog(n) and m=n+ω(n/ n) variables in subexponential time. Whereas their analysis involves interpreting the algorithm in terms of chains of lattices, our approach is quite elementary and is based on bounding the lower moments of a Fourier statistic.