Affordable Access

Improved hardness results for unique shortest vector problem

Authors
Publication Date
Source
Infoscience @ EPFL
Keywords
  • Computational Complexity
  • Lattices
  • Unique Svp
  • Np Hardness
  • Reductions
External links

Abstract

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments