A Decade of Lattice Cryptography
Foundations and Trends® in Theoretical Computer Science · 2016-03-24 · 10 (4) · 283-424
DOI: 10.1561/0400000074 ↗At a glance
Journal article in Foundations and Trends® in Theoretical Computer Science, published online on 2016-03-24. Written by Chris Peikert. Cited 448 times so far (Crossref); 187 references.
Abstract (original language)
Lattice-based cryptography is the use of conjectured hard problems on point lattices in ℝn as the foundation for secure cryptographic systems. Attractive features of lattice cryptography include apparent resistance to quantum attacks (in contrast with most number-theoretic cryptography), high asymptotic efficiency and parallelism, security under worst-case intractability assumptions, and solutions to long-standing open problems in cryptography. This work surveys most of the major developments in lattice cryptography over the past ten years. The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems (and their more efficient ring-based variants), their provable hardness assuming the worst-case intractability of standard lattice problems, and their many cryptographic applications.
Cite
APA
Peikert, C. (2016). A Decade of Lattice Cryptography. Foundations and Trends® in Theoretical Computer Science, 10(4), 283-424. https://doi.org/10.1561/0400000074
Vancouver
Peikert C. A Decade of Lattice Cryptography. Foundations and Trends® in Theoretical Computer Science. 2016;10(4):283-424. doi:10.1561/0400000074
BibTeX
@article{Peikert2016,
author = {Peikert, Chris},
title = {A Decade of Lattice Cryptography},
journal = {Foundations and Trends® in Theoretical Computer Science},
year = {2016},
volume = {10},
number = {4},
pages = {283--424},
doi = {10.1561/0400000074}
}
EUVIMED