## Explicit hard instances of the shortest vector problem (2008)

by
Johannes Buchmann
,
Richard Lindner
,
Markus Rückert
,
Michael Schneider

Citations: | 3 - 3 self |

### BibTeX

@TECHREPORT{Buchmann08explicithard,

author = {Johannes Buchmann and Richard Lindner and Markus Rückert and Michael Schneider},

title = {Explicit hard instances of the shortest vector problem },

institution = {},

year = {2008}

}

### OpenURL

### 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.