Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
From MaRDI portal
Publication:2128583
DOI10.1007/978-3-030-84245-1_25zbMATH Open1486.94075OpenAlexW3097076849MaRDI QIDQ2128583FDOQ2128583
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- BKZ 2.0: Better Lattice Security Estimates
- A hierarchy of polynomial time lattice basis reduction algorithms
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Trapdoors for hard lattices and new cryptographic constructions
- The Number of Lattice Points in a Set
- Predicting Lattice Reduction
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Floating-Point LLL Revisited
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Lattice Enumeration Using Extreme Pruning
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- The shortest vector in a lattice is hard to approximate to within some constant
- Fast Lattice Point Enumeration with Minimal Overhead
- New directions in nearest neighbor searching with applications to lattice sieving
- Practical, Predictable Lattice Basis Reduction
- Estimate all the {LWE, NTRU} schemes!
- Advanced lattice sieving on GPUs, with tensor cores
- The general sieve kernel and new records in lattice reduction
- Hardness of approximating the shortest vector problem in lattices
- 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
- Revisiting the expected cost of solving uSVP and applications to LWE
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- 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
- Estimating quantum speedups for lattice sieves
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Cited In (10)
- Lattice Reduction Algorithms: Theory and Practice
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Improving convergence and practicality of slide-type reductions
- Concrete analysis of quantum lattice enumeration
- Revisiting security estimation for LWE with hints from a geometric perspective
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- Quantum lattice enumeration in limited depth
- A complete analysis of the BKZ lattice reduction algorithm
Uses Software
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)
