This open access book covers the most cutting-edge and hot research topics and fields of post-quantum cryptography. The main purpose of this book is to focus on the computational complexity theory of lattice ciphers, especially the reduction principle of Ajtai, in order to fill the gap that post-quantum ciphers focus on the implementation of encryption and decryption algorithms, but the theoretical proof is insufficient. In Chapter 3, Chapter 4 and Chapter 6, author introduces the theory and technology of LWE distribution, LWE cipher and homomorphic encryption in detail. When using random analysis tools, there is a problem of "ambiguity" in both definition and algorithm. The greatest feature of this book is to use probability distribution to carry out rigorous mathematical definition and mathematical demonstration for various unclear or imprecise expressions, so as to make it a rigorous theoretical system for classroom teaching and dissemination. Chapters 5 and 7 further expand and improve the theory of cyclic lattice, ideal lattice and generalized NTRU cryptography.
This book is used as a professional book for graduate students majoring in mathematics and cryptography, as well as a reference book for scientific and technological personnel engaged in cryptography research.
|
|
|
|
|
|
3 | (4) |
|
1.2 Discrete Gauss Measure |
|
|
7 | (6) |
|
|
|
13 | (12) |
|
1.4 Some Properties of Discrete Gauss Distribution |
|
|
25 | (8) |
|
2 Reduction Principle of Ajtai |
|
|
33 | (20) |
|
|
|
33 | (2) |
|
|
|
35 | (4) |
|
|
|
39 | (7) |
|
|
|
46 | (7) |
|
|
|
53 | (46) |
|
|
|
53 | (8) |
|
3.2 SIS and Knapsack Problem on Ring |
|
|
61 | (11) |
|
|
|
72 | (8) |
|
3.4 Proof of the Main Theorem |
|
|
80 | (19) |
|
|
|
81 | (12) |
|
3.4.2 From DGS to Hard Problems on Lattice |
|
|
93 | (4) |
|
|
|
97 | (2) |
|
4 LWE Public Key Cryptosystem |
|
|
99 | (20) |
|
4.1 LWE Cryptosystem of Regev |
|
|
99 | (5) |
|
4.2 The Proof of Security |
|
|
104 | (4) |
|
4.3 Properties of Rounding Function |
|
|
108 | (4) |
|
4.4 General LWE-Based Cryptosystem |
|
|
112 | (3) |
|
4.5 Probability of Decryption Error for General Disturbance |
|
|
115 | (4) |
|
5 Cyclic Lattices and Ideal Lattices |
|
|
119 | (24) |
|
5.1 Some Basic Properties of Lattice |
|
|
119 | (4) |
|
|
|
123 | (6) |
|
|
|
129 | (8) |
|
5.4 Improved Upper Bound for Smoothing Parameter |
|
|
137 | (6) |
|
6 Fully Homomorphic Encryption |
|
|
143 | (32) |
|
6.1 Definitions and Examples |
|
|
144 | (4) |
|
6.2 Gadget Matrix and Gadget Technique |
|
|
148 | (6) |
|
6.3 Bounded Fully Homomorphic Encryption |
|
|
154 | (11) |
|
6.4 Construction of Gentry |
|
|
165 | (5) |
|
6.5 Attribute-Based Encryption |
|
|
170 | (5) |
|
7 A Generalization of NTRUencrypt |
|
|
175 | (14) |
|
|
|
176 | (6) |
|
7.2 A Generalization of NTRUencrypt |
|
|
182 | (7) |
| References |
|
189 | |
Zhiyong Zheng is Professor and Dean of School of Mathematics, Renmin University. His research and academic experiences include in 1995, Princeton University, as Visiting Scholar; in 1988-1991Shandong University Ph.D. He received Distinguished Paper Award (ICCM 2018), Qiu Shi Outstanding Young Scholar Award (1997) and The National Science Fund for Distinguished Young Scholars (1996). He was Dean of School of Mathematics, Renmin University of China. His research area includes Diophantine approximation, character sum and cryptography
Lisainfo e-raamatute kohta