Faster algorithms for solving LPN
From MaRDI portal
Publication:2820482
DOI10.1007/978-3-662-49890-3_7zbMATH Open1347.94064OpenAlexW2472923048MaRDI QIDQ2820482FDOQ2820482
Authors: Bin Zhang, Lin Jiao, Mingsheng Wang 
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
Recommendations
perfect codeLearning Parity with Noise (LPN)Blum-Kalai-Wasserman (BKW) algorithmLapinHopper-Blum (HB) protocol
Cited In (15)
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Efficient algorithms for three variants of the LPF table
- On solving LPN using BKW and variants, Implementation and analysis
- An iterative correction method for practically LPN solving
- Towards efficient LPN-based symmetric encryption
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- LPN decoded
- Correlated pseudorandomness from expand-accumulate codes
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Solving LPN using covering codes
- Pseudorandom correlation functions from variable-density LPN, revisited
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
- On iterative collision search for LPN and subset sum
- Efficient authentication from hard learning problems
This page was built for publication: Faster algorithms for solving LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820482)
