- We will send in 10–14 business days.
/images/books/11784702/9781680831122.jpg)
- Author: Chris Peikert
- Publisher: Now Publishers
- Year: 2016
- Pages: 156
- ISBN-10: 1680831127
- ISBN-13: 9781680831122
- Format: 15.6 x 23.4 x 0.9 cm, softcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn 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 monograph 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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 20d.00:19:27
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Chris Peikert
- Publisher: Now Publishers
- Year: 2016
- Pages: 156
- ISBN-10: 1680831127
- ISBN-13: 9781680831122
- Format: 15.6 x 23.4 x 0.9 cm, softcover
- Language: English English
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn 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 monograph 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.
Reviews