License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21267
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2126/
Go to the corresponding Portal


Schneider, Michael

Probabilistic Analysis of LLL Reduced Bases

pdf-format:
Document 1.pdf (257 KB)


Abstract

LLL reduction, originally founded in 1982 to factor certain polynomials, is a useful tool in public key cryptanalysis. The search for short lattice vectors helps determining the practical hardness of lattice problems, which are supposed to be secure against quantum computer attacks. It is a fact that in practice, the LLL algorithm finds much shorter vectors than its theoretic analysis guarantees. Therefore one can see that the guaranteed worst case bounds are not helpful for practical purposes. We use a probabilistic approach to give an estimate for the length of the shortest vector in an LLL-reduced bases that is tighter than the worst case bounds.

BibTeX - Entry

@InProceedings{schneider:DSP:2009:2126,
  author =	{Michael Schneider},
  title =	{Probabilistic Analysis of LLL Reduced Bases},
  booktitle =	{Algorithms and Number Theory },
  year =	{2009},
  editor =	{Johannes A. Buchmann and John Cremona and Michael E. Pohst},
  number =	{09221},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2126},
  annote =	{Keywords: Lattice reduction, LLL algorithm}
}

Keywords: Lattice reduction, LLL algorithm
Seminar: 09221 - Algorithms and Number Theory
Issue Date: 2009
Date of publication: 20.08.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI