Revisiting security estimation for LWE with hints from a geometric perspective
From MaRDI portal
Recommendations
Cites work
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs
- Assessing the feasibility of single trace power analysis of Frodo
- Assessment of the key-reuse resilience of NewHope
- BKZ 2.0: Better lattice security estimates
- Cold boot attacks on BLISS
- Complete attack on RLWE key exchange with reused keys, without signal leakage
- Continuous LWE
- Decryption failure attacks on IND-CCA secure lattice-based schemes
- Decryption failure is more likely after success
- Feature Article—The Ellipsoid Method: A Survey
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 1979272 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- scientific article; zbMATH DE number 975560 (Why is no real title available?)
- Hull attacks on the lattice isomorphism problem
- Integer Programming with a Fixed Number of Variables
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- LWE with side information: attacks and concrete security estimation
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- New directions in nearest neighbor searching with applications to lattice sieving
- On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids
- On the complexity of the BKW algorithm on LWE
- Revisiting the expected cost of solving uSVP and applications to LWE
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(10)- Too many hints -- when LLL breaks LWE
- The complexity of algebraic algorithms for LWE
- Finding and protecting the weakest link. On side-channel attacks on \(\mathrm{y}\) in masked ML-DSA
- Refined attack on LWE with hints: constructing lattice via Gaussian elimination
- A generic framework for side-channel attacks against LWE-based cryptosystems
- Revisiting the security of approximate FHE with noise-flooding countermeasures
- One bit to rule them all -- imperfect randomness harms lattice signatures
- Fast slicer for Batch-CVP: making lattice hybrid attacks practical
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- One (noisy) bit to rule them all: key recovery from randomness leakage in ML-DSA
This page was built for publication: Revisiting security estimation for LWE with hints from a geometric perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190156)
