The following pages link to Solving LPN Using Covering Codes (Q2938835):
Displaying 13 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Noisy Simon period finding (Q826245) (← links)
- Fast near collision attack on the Grain v1 stream cipher (Q1648861) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
- Reduction from sparse LPN to LPN, dual attack 3.0 (Q6637725) (← links)
