On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor

Micciancio, Danielle

On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor

Download

Name

MIT-LCS-TM-574.pdf

Size

843.44 KB

Format

Adobe PDF

Checksum (MD5)

ec41c54bd5f1e5350bcb0fd525c59246

Author(s)

Micciancio, Danielle

Date Issued

January 1998

Series/Report no.

MIT-LCS-TM-574

Abstract

We show that computing the approximate length of the shortest vector in a lattice within a factor c is NP-hard for randomized reductions for any constant c < ? (2).

Persistent DSpace Link

https://hdl.handle.net/1721.1/149274