Lazy modulus switching for the BKW algorithm on LWE
From MaRDI portal
Publication:5402986
Recommendations
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
- Lattice decoding attacks on binary LWE
- Making the BKW algorithm practical for LWE
- Coded-BKW: solving LWE using lattice codes
- Solving LWR via BDD Strategy: Modulus Switching Approach
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Predicting the concrete security of LWE against the dual attack using binary search
- Further improvements of the estimation of key enumeration with applications to solving LWE
- (In)security of ring-LWE under partial key exposure
- Solving LPN using covering codes
- On the asymptotic complexity of solving LWE
- On the complexity of the BKW algorithm on LWE
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- An improved BKW algorithm for LWE with applications to cryptography and lattices
This page was built for publication: Lazy modulus switching for the BKW algorithm on LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402986)