Back to Results
First PageMeta Content
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 crypt
Add to Reading List

Document Date: 2008-12-01 09:32:36


Open Document

File Size: 147,01 KB

Share Result on Facebook
UPDATE