ACM SIGACT News
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
Generating Hard Instances of the Short Basis Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Minimum Volume of a Perturbed Unit Cube
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The optimal LLL algorithm is still polynomial in fixed dimension
Theoretical Computer Science - Latin American theoretical informatics
ACM Transactions on Algorithms (TALG)
Journal of Computer and System Sciences
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
New NP-Complete Problems Associated with Lattices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A digital signature scheme based on CV P∞
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
| Hi-index | 0.00 |
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.