On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor
| dc.contributor.author | Micciancio, Danielle | en_US |
| dc.date.accessioned | 2023-03-29T14:40:39Z | |
| dc.date.available | 2023-03-29T14:40:39Z | |
| dc.date.issued | 1998-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149274 | |
| dc.description.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). | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-574 | |
| dc.title | On the Inapproximability of the Shortest Vector in a Lattice Within Some Constant Factor | en_US |
