Hardness of bounded distance decoding on lattices in lp norms
From MaRDI portal
Publication:5092487
DOI10.4230/LIPIcs.CCC.2020.36OpenAlexW3013646474MaRDI QIDQ5092487
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2003.07903
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the packing densities of superballs and other bodies
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Lattice points in high-dimensional spheres
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
- Lattice problems and norm embeddings
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Hardness of approximating the shortest vector problem in lattices
- Trapdoors for hard lattices and new cryptographic constructions
- On Bounded Distance Decoding for General Lattices
- The hardness of the closest vector problem with preprocessing
- Discrete Gaussian Sampling Reduces to CVP and SVP
- Public-key cryptosystems from the worst-case shortest vector problem
- (Gap/S)ETH hardness of SVP
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
- On lattices, learning with errors, random linear codes, and cryptography
- On the unique shortest lattice vector problem
- On the complexity of \(k\)-SAT
This page was built for publication: Hardness of bounded distance decoding on lattices in lp norms
