Welcome to the resource topic for 2008/333
Title:
Explicit hard instances of the shortest vector problem
Authors: Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider
Abstract:Building upon a famous result due to Ajtai, we propose a sequence of lattice bases with growing dimension, which can be expected to be hard instances of the shortest vector problem (SVP) and which can therefore be used to benchmark lattice reduction algorithms. The SVP is the basis of security for potentially post-quantum cryptosystems. We use our sequence of lattice bases to create a challenge, which may be helpful in determining appropriate parameters for these schemes.
ePrint: https://eprint.iacr.org/2008/333
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 .