Faster algorithms for solving LPN

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

zbMATH Keywords

perfect codeLearning Parity with Noise (LPN)Blum-Kalai-Wasserman (BKW) algorithmLapinHopper-Blum (HB) protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Solving LPN using covering codes
• Solving LPN Using Covering Codes
• On solving LPN using BKW and variants, Implementation and analysis
• Optimization of \(\mathsf {LPN}\) solving algorithms
• LPN decoded

Cited in

(15)

• Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
• On solving LPN using BKW and variants, Implementation and analysis
• Pseudorandom correlation functions from variable-density LPN, revisited
• Towards efficient LPN-based symmetric encryption
• Efficient authentication from hard learning problems
• Optimization of \(\mathsf {LPN}\) solving algorithms
• On iterative collision search for LPN and subset sum
• An iterative correction method for practically LPN solving
• Efficient algorithms for three variants of the LPF table
• An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
• Correlated pseudorandomness from expand-accumulate codes
• LPN decoded
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• Solving LPN using covering codes
• Correlated pseudorandomness from the hardness of quasi-abelian decoding

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)