Title :
Some recent progress on the complexity of lattice problems
Author_Institution :
Dept. of Comput. Sci. & Eng., State Univ. of New York, Buffalo, NY, USA
Abstract :
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 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
Keywords :
computational complexity; cryptography; NP-hardness; complexity; cryptosystem; intractability; lattice problems; non-NP-hardness; transference theorems; Computer science; Lattices; Public key cryptography; Security;
Conference_Titel :
Computational Complexity, 1999. Proceedings. Fourteenth Annual IEEE Conference on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7695-0075-7
DOI :
10.1109/CCC.1999.766274
