Paper 2008/333 Original: eprint.iacr.org/2008/333 ↗
Explicit hard instances of the shortest vector problem
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2008-12-01: last updated
- 2008-08-03: published
- Short URL
- https://ia.cr/2008/333
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/333,
author = {Johannes Buchmann and Richard Lindner and Markus Rückert and Michael Schneider},
title = {Explicit hard instances of the shortest vector problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/333},
year = {2008},
url = {https://eprint.iacr.org/2008/333}
}