eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2009-02-19
75
86
10.4230/LIPIcs.STACS.2009.1832
article
Generating Shorter Bases for Hard Random Lattices
Alwen, Joel
Peikert, Chris
We revisit the problem of generating a ``hard'' random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptographic schemes that use such a procedure for generating public/secret key pairs. In these applications, a shorter basis directly corresponds to milder underlying complexity assumptions and smaller key sizes.
The contributions of this work are twofold. First, using the \emph{Hermite normal form} as an organizing principle, we simplify and generalize an approach due to Ajtai (ICALP 1999). Second, we improve the construction and its analysis in several ways, most notably by tightening the length of the output basis essentially to the optimum value.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol003-stacs2009/LIPIcs.STACS.2009.1832/LIPIcs.STACS.2009.1832.pdf
Lattices
Random
Short basis
Average-case hardness
Hermite normal form
Cryptography