Refined modelling of the primal attack, and variants against Module-LWE
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- A refined analysis of the cost for solving LWE via uSVP
- A toolkit for ring-LWE cryptography
- Accurate score prediction for Dual-Sieve attacks
- An extension of Kannan's embedding for solving ring-based LWE problems
- An LLL algorithm for module lattices
- BKZ 2.0: Better lattice security estimates
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fast Fourier orthogonalization
- Finding dense submodules with algebraic lattice reduction
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- Improved provable reduction of NTRU and hypercubic lattices
- Large FHE gates from tensored homomorphic accumulator
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice decoding attacks on binary LWE
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- LWE with side information: attacks and concrete security estimation
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Minkowski's Convex Body Theorem and Integer Programming
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the hardness of module learning with errors with short distributions
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- On the success probability of solving unique SVP via BKZ
- Revisiting the expected cost of solving uSVP and applications to LWE
- Ring-LWE in polynomial rings
- The general sieve kernel and new records in lattice reduction
- Worst-case to average-case reductions for module lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: Refined modelling of the primal attack, and variants against Module-LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319512)
