Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
From MaRDI portal
Publication:2128583
Recommendations
Cites work
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 44906 (Why is no real title available?)
- scientific article; zbMATH DE number 3456979 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- Advanced lattice sieving on GPUs, with tensor cores
- Analyzing blockwise lattice algorithms using dynamical systems
- BKZ 2.0: Better lattice security estimates
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Estimating quantum speedups for lattice sieves
- Factoring polynomials with rational coefficients
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- Fast lattice point enumeration with minimal overhead
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Finding short lattice vectors within Mordell's inequality
- Floating-Point LLL Revisited
- Hardness of approximating the shortest vector problem in lattices
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- New directions in nearest neighbor searching with applications to lattice sieving
- On lattices, learning with errors, random linear codes, and cryptography
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- Practical, Predictable Lattice Basis Reduction
- Predicting Lattice Reduction
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum lattice enumeration and tweaking discrete pruning
- Revisiting the expected cost of solving uSVP and applications to LWE
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Tensor-based hardness of the shortest vector problem to within almost polynomial factors
- The Number of Lattice Points in a Set
- The general sieve kernel and new records in lattice reduction
- The shortest vector in a lattice is hard to approximate to within some constant
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(12)- Quantum lattice enumeration in limited depth
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- Lattice Reduction Algorithms: Theory and Practice
- Concrete analysis of quantum lattice enumeration
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Improving convergence and practicality of slide-type reductions
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Fast lattice point enumeration with minimal overhead
- Revisiting security estimation for LWE with hints from a geometric perspective
- A complete analysis of the BKZ lattice reduction algorithm
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
This page was built for publication: Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128583)
