密碼理論
Theory of cryptology
| 節 | 週三 |
|---|---|
3 10:10–11:00 | 密碼理論 ED302（光復） 3 節連堂 |
4 11:10–12:00 | |
N 12:20–13:10 |
* 根據陽明交大上課時間表所列
(1)學習密碼設計與安全分析的方法 (2)適合對進階密碼學有興趣的研究生修習
elementary cryptography, probability, algorithm
無備註
上課、作業、考試
(Tentative) Homework: 30% Midterms: 35% Final: 35%
Introduction
- 講授：
- 3
Algebra & number theory
- 講授：
- 3
Symmetric-key encryption
- 講授：
- 3
Public-key cryptography
- 講授：
- 6
Factorization by quantum computers
- 講授：
- 3
Probabilistic algorithms
- 講授：
- 3
Cryptographic protocols
- 講授：
- 6
One-way function and basic assumptions
- 講授：
- 3
Bit-security of one-way functions
- 講授：
- 3
One-way functions and pseudorandomness
- 講授：
- 6
Provably secure encryption
- 講授：
- 3
Probably secure digital signature
- 講授：
- 3
Selected topics on cryptography
- 講授：
- 3
| 週次 | 主題 |
|---|---|
| 第 1 週 | Introduction 2024-02-21(三) |
| 第 2 週 | Algebra & number theory 2024-02-28(三) |
| 第 3 週 | Symmetric-key encryption 2024-03-06(三) |
| 第 4 週 | Public-key cryptography (1/2) 2024-03-13(三) |
| 第 5 週 | Public-key cryptography (2/2) 2024-03-20(三) |
| 第 6 週 | Factorization by quantum computers 2024-03-27(三) |
| 第 7 週 | Cryptographic protocols (I) 2024-04-03(三) |
| 第 8 週 | Midterm 2024-04-10(三) |
| 第 9 週 | Cryptographic protocols (II) 2024-04-17(三) |
| 第 10 週 | One-way function and basic assumptions 2024-04-24(三) |
| 第 11 週 | Bit-security of one-way functions 2024-05-01(三) |
| 第 12 週 | One-way functions and pseudorandomness (1/2) 2024-05-08(三) |
| 第 13 週 | One-way functions and pseudorandomness (2/2) 2024-05-15(三) |
| 第 14 週 | Provably secure encryption 2024-05-22(三) |
| 第 15 週 | Probably secure digital signature 2024-05-29(三) |
| 第 16 週 | Selected topics on cryptography 2024-06-05(三) |
| 第 17 週 | Final 2024-06-12(三) |
| 第 18 週 | 2024-06-19(三) |
H. Delfs, H. Knebl, Introduction to Cryptography: Principles and Applications (2nd Ed.), Springer, 2007. References: D.R. Stinson, "Cryptography: theory and practice", CRC Press, 1995. M. Luby, "Pseudorandomness and cryptographic applications," Princeton University Press, 1996. D. Du , K.-I Ko, "Theory of computational complexity," John Wiley & Sons, 2000. O. Goldreich. "Foundations of cryptography: basic tools", Cambridge Univ. Press, 2001. M. Mitzernmacher, E. Upfal, "Probability and Computing: randomized algorithms and probabilistic analysis", Cambridge University Press, 2005.
- 地點
- EC238
- 時間
- (1) 2:00-3:30pm, Tuesday (2) 2:00-3:30pm, Wednesday (3) By appointment via email
- 聯絡方式
- wgtzeng@cs.nctu.edu.tw