Improving convergence and practicality of slide-type reductions

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?)
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
Predicting Lattice Reduction
Lattice Point Enumeration on Block Reduced Bases
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
The shortest vector in a lattice is hard to approximate to within some constant
On Positive Definite Quadratic Forms
Practical, Predictable Lattice Basis Reduction
Observation on the Minimum of a Positive Quadratic Form in Eight Variables
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
Approximating the densest sublattice from Rankin's inequality
Algorithms for the Densest Sub-Lattice Problem
Rankin’s Constant and Blockwise Lattice Reduction
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
Symplectic Lattice Reduction and NTRU
The convergence of slide-type reductions
Bounding basis reduction properties
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
Inapproximability of the shortest vector problem: toward a deterministic reduction
Bounds for Cofactors and Arithmetic Minima of Quadratic Forms

Cited In (3)

Slide reduction, successive minima and several~applications
Slide reduction, revisited -- filling the gaps in SVP approximation
A complete analysis of the BKZ lattice reduction algorithm

Uses Software

BKZ
fpLLL

This page was built for publication: Improving convergence and practicality of slide-type reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687993)