# On Bounded Distance Decoding for General Lattices

@inproceedings{Liu2006OnBD,
title={On Bounded Distance Decoding for General Lattices},
author={Yi-Kai Liu and Vadim Lyubashevsky and Daniele Micciancio},
booktitle={APPROX-RANDOM},
year={2006}
}
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice $\mathcal{L}$ represented by some basis, and a target point $\vec{y}$, find the lattice point closest to $\vec{y}$. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance $\lambda_1(\mathcal{L})$ of the lattice. Specifically, in the α-Bounded Distance Decoding problem (α-BDD), we are given a lattice… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 36 CITATIONS

## Time-Memory Trade-Off for Lattice Enumeration in a Ball

• IACR Cryptology ePrint Archive
• 2016
VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## FrodoKEM Learning With Errors Key Encapsulation Algorithm

• 2017
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## On lattices, learning with errors, random linear codes, and cryptography

• J. ACM
• 2005
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

## Generalizations of Banaszczyk's transference theorems and tail bound

• IACR Cryptology ePrint Archive
• 2018

## NTRU-LPR IND-CPA: A New Ideal Lattices-based Scheme

• IACR Cryptology ePrint Archive
• 2018

VIEW 3 EXCERPTS
CITES BACKGROUND

## Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling

• IEEE Transactions on Information Theory
• 2017
VIEW 1 EXCERPT
CITES BACKGROUND

## Pseudorandomness of ring-LWE for any ring and modulus

• STOC
• 2017
VIEW 1 EXCERPT
CITES METHODS

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

## Improved Inapproximability of Lattice and Coding Problems With Preprocessing

• IEEE Trans. Information Theory
• 2004
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL

## Lattice Problems in NP ∩ coNP

• 2004
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

## The shortest vector problem is NP-hard to approximate to within some constant

D. Micciancio
• SIAM J. on Computing,
• 2001
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

## Finding the closest lattice vector when it's unusually close

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

## Approximating-CVP to within almost-polynomial factors is NP-hard

• Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
• 1998
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

## The hardness of approximate optima in lattices, codes, and systems of linear equations

• Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
• 1993
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

## Hardness of Approximating the Closest Vector Problem with Pre-Processing

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

• STOC
• 2006
VIEW 3 EXCERPTS

• FOCS
• 2004
VIEW 2 EXCERPTS

## Closest point search in lattices

• IEEE Trans. Information Theory
• 2002
VIEW 1 EXCERPT