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 instances suggested for 80-bit security in cryptographic schemes like HB variants, LPN-C and Lapin, in less than 280 operations.
Cite
CITATION STYLE
Guo, Q., Johansson, T., & Löndahl, C. (2014). Solving LPN using covering codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8873, pp. 1–20). Springer Verlag. https://doi.org/10.1007/978-3-662-45611-8_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
