Welcome to the resource topic for 2013/052
Title:
Some Complexity Results and Bit Unpredictable for Short Vector Problem
Authors: Kuan Cheng
Abstract:In this paper, we prove that finding the approximate shortest vector with length in [\lambda_{1},\gamma \lambda_{1} ] could be reduced to GapSVP. We also prove that shortest vector problem could also be reduced to GapSVP with a small gap. As the complexity of uSVP is not very clear, we improve crurrent complexity results\cite{AD2011} of uSVP, proving uSVP could be reduced from SVP deterministically. What’s more, we prove that the search version of uSVP could be reduced to decisional version of uSVP with almost the same gap. At last, based on the results above, we prove a bit-unpredictable property of SVP.
ePrint: https://eprint.iacr.org/2013/052
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .