期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：1999
卷号：1999
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We survey some recent developments in the study of
the complexity of lattice problems. After a discussion of some
problems on lattices which can be algorithmically solved
efficiently, our main focus is the recent progress on complexity
results of intractability. We will discuss Ajtai's worst-case/
average-case connections, NP-hardness and non-NP-hardness,
transference theorems between primal and dual lattices, and the
Ajtai-Dwork cryptosystem.
(This is a survey article appearing in the Conference on
Computational Complexity at FCRC, May 1999.)
关键词：average case complexity, cryptosystems, Lattice problems
