Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
From MaRDI portal
Publication:2128583
DOI10.1007/978-3-030-84245-1_25zbMath1486.94075OpenAlexW3097076849MaRDI QIDQ2128583
Jianwei Li, Shi Bai, Martin R. Albrecht, Joe Rowell
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_25
Related Items (4)
\(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Improving convergence and practicality of slide-type reductions ⋮ Revisiting security estimation for LWE with hints from a geometric perspective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Quantum lattice enumeration and tweaking discrete pruning
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- Estimate all the {LWE, NTRU} schemes!
- Advanced lattice sieving on GPUs, with tensor cores
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Slide reduction, revisited -- filling the gaps in SVP approximation
- The general sieve kernel and new records in lattice reduction
- Revisiting the expected cost of solving uSVP and applications to LWE
- Estimating quantum speedups for lattice sieves
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Practical, Predictable Lattice Basis Reduction
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
- BKZ 2.0: Better Lattice Security Estimates
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- The Number of Lattice Points in a Set
- Hardness of approximating the shortest vector problem in lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Enumeration Using Extreme Pruning
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- New directions in nearest neighbor searching with applications to lattice sieving
- Public-key cryptosystems from the worst-case shortest vector problem
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Fast Lattice Point Enumeration with Minimal Overhead
- Floating-Point LLL Revisited
- Predicting Lattice Reduction
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
