MathematicsComputer Science

J. Alwen, Chris Peikert

2009.2.26THEORY OF COMPUTING SYSTEMS

DOI: 10.1007/s00224-010-9278-3

tlooto Summary

This work revisits the problem of generating a ‘hard’ random lattice together with a basis of relatively short vectors and improves the construction and its analysis in several ways, most notably by making the output basis asymptotically as short as possible.

Abstract

Abstract is not available.

Citation format

ALWEN, J.; PEIKERT, Chris. Generating shorter bases for hard random lattices. THEORY OF COMPUTING SYSTEMS, 2009, 48: 535–553.