Solving LPN Using Covering Codes
Qian Guo, Thomas P. Johansson, Carl Löndahl · Journal of Cryptology · 2019
Abstract We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a linear code. It outperforms previous methods for many parameter choices. In particular, we can now solve the $$(512,\frac{1}{8})$$ (512,18) LPN instance with complexity less than $$2^{80}$$ 280 operations in expectation, indicating that cryptographic schemes like HB variants and LPN-C should increase their parameter size for 80-bit security.