Lattice-Based Cryptography

Abstract

In this chapter we describe some of the recent progress in lattice-based cryptography. Lattice-based cryptographic constructions hold a great promise for post-quantum cryptography, as they enjoy very strong security proofs based on worst-case hardness, relatively efficient implementations, as well as great simplicity. In addition, lattice-based cryptography is believed to be secure against quantum computers. Our focus here will be mainly on the practical aspects of lattice-based cryptography and less on the methods used to establish their security. For other surveys on the topic of lattice-based cryptography, see, e.g., [60, 36, 72, 51] and the lecture notes [50, 68]. The survey by Nguyen and Stern [60] also describes some applications of lattices in cryptanalysis, an important topic that we do not discuss here. Another useful resource is the book by Micciancio and Goldwasser [53], which also contains a wealth of information on the computational complexity aspects of lattice problems.

DOI: 10.1007/978-1-4419-5906-5_417

Extracted Key Phrases

7 Figures and Tables

02040602008200920102011201220132014201520162017
Citations per Year

358 Citations

Semantic Scholar estimates that this publication has 358 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Micciancio2005LatticeBasedC, title={Lattice-Based Cryptography}, author={Daniele Micciancio}, booktitle={Encyclopedia of Cryptography and Security}, year={2005} }