Abstract
The LPN problem, lying at the core of many cryptographic constructions for lightweight and post-quantum cryptography, receives quite a lot attention recently. The best published algorithm for solving it at Asiacrypt 2014 improved the classical BKW algorithm by using covering codes, which claimed to marginally compromise the 80-bit security of HB variants, LPN-C and Lapin. In this paper, we develop faster algorithms for solving LPN based on an optimal precise embedding of cascaded concrete perfect codes, in a similar framework but with many optimizations. Our algorithm outperforms the previous methods for the proposed parameter choices and distinctly break the 80-bit security bound of the instances suggested in cryptographic schemes like HB+, HB#, LPN-C and Lapin.
Author supplied keywords
Cite
CITATION STYLE
Zhang, B., Jiao, L., & Wang, M. (2016). Faster algorithms for solving LPN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9665, pp. 168–195). Springer Verlag. https://doi.org/10.1007/978-3-662-49890-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
