Generating Shorter Bases for Hard Random Lattices

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

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Joël Alwen, Chris Peikert
• Keywords: Public/secret Key Pairs, Smaller Key Sizes, STACS 2009, Theoretical Computer Science, Underlying Complexity Assumptions