Faster Algorithms for Solving LPN
From MaRDI portal
Publication:2820482
DOI10.1007/978-3-662-49890-3_7zbMath1347.94064OpenAlexW2472923048MaRDI QIDQ2820482
Bin Zhang, Mingsheng Wang, Lin Jiao
Publication date: 9 September 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_7
perfect codeLearning Parity with Noise (LPN)Blum-Kalai-Wasserman (BKW) algorithmLapinHopper-Blum (HB) protocol
Related Items
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Efficient authentication from hard learning problems ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Solving LPN using covering codes ⋮ Towards efficient LPN-based symmetric encryption
