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. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Buchmann, J., Lindner, R., & Rückert, M. (2008). Explicit hard instances of the shortest vector problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5299 LNCS, pp. 79–94). Springer Verlag. https://doi.org/10.1007/978-3-540-88403-3_6
Mendeley helps you to discover research relevant for your work.