Solving LPN Using Covering Codes

DOI10.1007/978-3-662-45611-8_1zbMath1306.94059OpenAlexW1890539633MaRDI QIDQ2938835

Thomas Johansson, Qian Guo, Carl Löndahl

Publication date: 16 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1956/22601

zbMATH Keywords

Learning Parity with Noise (LPN)

Mathematics Subject Classification ID

Cryptography (94A60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (12)

On solving LPN using BKW and variants, Implementation and analysis ⋮ Noisy Simon period finding ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Making the BKW algorithm practical for LWE ⋮ Fast near collision attack on the Grain v1 stream cipher ⋮ Solving the learning parity with noise problem using quantum algorithms ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ Efficient authentication from hard learning problems ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ Solving LPN using covering codes ⋮ Towards efficient LPN-based symmetric encryption

This page was built for publication: Solving LPN Using Covering Codes