The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt - Lenstra–Lenstra–Lovász lattice basis reduction algorithm - Document - PDFSEARCH.IO

First Page	Meta Content
	The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt Add to Reading List Document Date: 2008-12-01 09:32:36 Open Document File Size: 147,01 KB Share Result on Facebook City Tensor / / Company Rn / / / Facility Tel-Aviv University / Introduction Building / / IndustryTerm search versions / search problem / trap-door generating algorithm / sieve algorithm / quotient / quantum algorithms / / Organization Tel-Aviv University / / Person Chris Peikert / L. Lovasz / A. K. Lenstra / H. W. Lenstra Jr. / / Position SVP / decisional SVP / / PublishedMedium Mathematische Annalen / / Technology trap-door generating algorithm / cryptography / quantum algorithms / sieve algorithm / LLL algorithm / / SocialTag Abstract algebra Lattice problem Lattice Learning with errors Vector space Lenstra–Lenstra–Lovász lattice basis reduction algorithm Lattice-based cryptography Algebra Mathematics Cryptography

The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based cryptAdd to Reading List