The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography
share
In the average-case k-SUM problem, given r integers chosen uniformly at random from {0,…,M-1}, the objective is to find a set of k numbers that sum to 0 modulo M (this set is called a solution). In the related k-XOR problem, given k uniformly random Boolean vectors of length logM, the objective is to find a set of k of them whose bitwise-XOR is the all-zero vector. Both of these problems have widespread applications in the study of fine-grained complexity and cryptanalysis. The feasibility and complexity of these problems depends on the relative values of k, r, and M. The dense regime of M ≤ r^k, where solutions exist with high probability, is quite well-understood and we have several non-trivial algorithms and hardness conjectures here. Much less is known about the sparse regime of M≫ r^k, where solutions are unlikely to exist. The best answers we have for many fundamental questions here are limited to whatever carries over from the dense or worst-case settings. We study the planted k-SUM and k-XOR problems in the sparse regime. In these problems, a random solution is planted in a randomly generated instance and has to be recovered. As M increases past r^k, these planted solutions tend to be the only solutions with increasing probability, potentially becoming easier to find. We show several results about the complexity and applications of these problems, including conditional lower bounds for r^k ≤ M ≤ r^2k, a search-to-decision reduction for M > r^k, hardness amplification for M ≥ r^k, a construction of PKE for some M ≤ 2^polylog(r), and non-trivial algorithms for any M ≥ 2^r^2.
READ FULL TEXT