Post-Quantum Cryptography II
The most widely used nowadays are the number theoretical based cryptosystems such as RSA, DSA, and ECC. However, due to Peter Shor's Algorithm, such cryptosystems would become insecure if a large Quantum computer is built. We need to develop a new family of cryptosystems that can resist quantum computers attacks. Researchers usually use Post-Quantum Cryptography (PQC) to denote this new family. In the course, we will talk about Post-Quantum Cryptography.
Lecturer
Cheng Dong Tao
Date
14th September ~ 14th December, 2022
Website
Prerequisite
Mordern Cryptography, Coding Theory, C Programming Language
Syllabus
Code-based cryptography
1. Mathematical Background
2. Shannon's Theorem
3. Linear Codes
4. Some Good Codes
5. Bounds on Codes
6. Cyclic Codes
7. Perfect Codes and Uniformly Packed Codes
8. Goppa Codes
9. Algebraic Geometry Codes
10. Code-based Cryptosystems of NIST PQC ROUND 4
1. Mathematical Background
2. Shannon's Theorem
3. Linear Codes
4. Some Good Codes
5. Bounds on Codes
6. Cyclic Codes
7. Perfect Codes and Uniformly Packed Codes
8. Goppa Codes
9. Algebraic Geometry Codes
10. Code-based Cryptosystems of NIST PQC ROUND 4
Reference
1. Introduction to Coding Theory J.H. van Lint, GTM86
2. Post-Quantum Cryptography Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen Editors
2. Post-Quantum Cryptography Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen Editors
Audience
Graduate
Video Public
No
Notes Public
No
Language
Chinese
Lecturer Intro
Dr. Chengdong Tao got his Ph.D from South China University of Technology in 2015. Then he became an engineer at Shenzhen Huawei Technology Co., Ltd., and Executive Director and General Manager at Guangzhou Liangjian Technology Co., Ltd.. From 2020, he has been an Assistant Professor, and in 2023 Associated Professor of Yanqi Lake Beijing Institute of Mathematical Sciences and Applications. His Research Interests include Computational Algebra, Post-quantum Cryptography, Fast Implementation.