We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

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

Thumbnail Image
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
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.