Predicting the concrete security of LWE against the dual attack using binary search
From MaRDI portal
Publication:2673056
Recommendations
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack
- On the concrete hardness of learning with errors
Cites work
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Better key sizes (and attacks) for LWE-based encryption
- BKZ 2.0: Better lattice security estimates
- Coded-BKW: solving LWE using lattice codes
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Faster exponential time algorithms for the shortest vector problem
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Lattice decoding attacks on binary LWE
- Lattice enumeration using extreme pruning
- Lattice-based Cryptography
- Lazy modulus switching for the BKW algorithm on LWE
- New Algorithms for Learning in Presence of Errors
- New directions in nearest neighbor searching with applications to lattice sieving
- Noise-tolerant learning, the parity problem, and the statistical query model
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- Random sampling revisited: lattice enumeration with discrete pruning
- Revisiting the expected cost of solving uSVP and applications to LWE
- Shortest vector from lattice sieving: a few dimensions for free
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- The general sieve kernel and new records in lattice reduction
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
Cited in
(7)- Verifying solutions to LWE with implications for concrete security
- LWE with side information: attacks and concrete security estimation
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- Attacks on the Search RLWE Problem with Small Errors
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Provable dual attacks on learning with errors
- Further improvements of the estimation of key enumeration with applications to solving LWE
This page was built for publication: Predicting the concrete security of LWE against the dual attack using binary search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673056)
