Solving LPN Using Covering Codes
From MaRDI portal
Recommendations
- Solving LPN using covering codes
- scientific article; zbMATH DE number 1024657
- On covering problems of codes
- scientific article; zbMATH DE number 3952657
- Construction of linear covering codes
- Linear programming bounds for codes via a covering argument
- Using linear programming to decode LDPC codes
- Integer programming for covered codes
- scientific article; zbMATH DE number 1229706
- Long packing and covering codes
Cited in
(20)- Decoding linear codes with high error rate and its impact for LPN security
- Fast near collision attack on the Grain v1 stream cipher
- LPN decoded
- Efficient authentication from hard learning problems
- Towards efficient LPN-based symmetric encryption
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Making the BKW algorithm practical for LWE
- Solving LPN using covering codes
- BKW meets Fourier new algorithms for LPN with sparse parities
- On solving LPN using BKW and variants, Implementation and analysis
- Faster algorithms for solving LPN
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Solving the learning parity with noise problem using quantum algorithms
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
- An iterative correction method for practically LPN solving
- Reduction from sparse LPN to LPN, dual attack 3.0
- Memory-efficient BKW algorithm for solving the LWE problem
- Optimizing c-sum BKW and faster quantum variant for LWE
- A BKW-style solver for the restricted syndrome decoding problem
- Noisy Simon period finding
This page was built for publication: Solving LPN Using Covering Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938835)
