# 現代密碼學的理論基礎 114-2

## Course Info
* Course number: CSIE5037
* Location: 資105
* Time: 星期五，3,4,5 (10:20~13:10)
* Mail : csie dot tamc at gmail dot com
* Instructor: [Kai-Min Chung](https://homepage.iis.sinica.edu.tw/~kmchung/)
* Website: [NTU COOL](https://cool.ntu.edu.tw/courses/59698)
* Office hour: 星期一13:20~15:10 和 星期五15:10 -17:00 (地點:439)

## Announcement
* HW1 dealine is change to 4/12(日)23:59，遲交時間最晚4/14(二) 23:59.
* ~~HW1 is out (deadline 4/5(日)23:59,遲交時間最晚4/7(二) 23:59).~~
* [Office hour 調查表](https://forms.gle/eySR2oxJ1ZRQFqrQ8) 和 [Scribe schedule](https://docs.google.com/spreadsheets/d/1Wa7Sc5b9-U3ieg4EcHA3qUtYzIgo-Yg0Bi76MCvG2Pk/edit?gid=0#gid=0) are out (Deadline 3/16 (一) **11:59**).
* HW0 is out (dealine 3/4 at **23:59**).
* [Overleaf](https://www.overleaf.com/read/bmdgrngqmhyc#773c7b) templates for homework and scribe.
* Feedbacks from students of [2023](https://drive.google.com/file/d/1ZRbMgTUM1HZcGa8xTvyJBn79N6ekyWuk/view?usp=drivesdk) and [2022](https://drive.google.com/file/d/15Y3GkGieCV1uo1qaii7G8CuQpSqbVJ6a/view?usp=drivesdk)

## Syllabus

| Week |Date| Info | Video Link |
| :----: | :---:|---| --- |
|Week 1|2/27|Holiday ([HW0](https://drive.google.com/file/d/1JoNq8mBPEz3ZQphvW4v3E_cHyPraICVy/view?usp=drive_link),[HW0_OWF_slide](https://docs.google.com/presentation/d/1kIcOWUjaejKNVw58BZOqI5eBqP6JWe-C/edit?usp=drive_link&ouid=114163345387795986070&rtpof=true&sd=true))||
|Week 2|3/6|Introduction ([slide](https://docs.google.com/presentation/d/1DDcYYNpp_3mRK-bnu_rv9-MWYQmAsRZF/edit?usp=drive_link&ouid=114163345387795986070&rtpof=true&sd=true))||
|Week 3|3/13|One-Way function ([slide](https://drive.google.com/file/d/1cnv4IhRAjw3BfSNtEy4ZEse7hmX9CJnQ/view?usp=drive_link), [Scribe_B09501109](https://www.overleaf.com/read/qnnkkqwqncrt#07bec4), [Scribe_B11902053](https://www.overleaf.com/read/ztqhjjmxtzxk#bb6b6c))|[all](https://youtu.be/WB4W-fB8pWk)|
|Week 4|3/20|Pseudo-randomness ([slide](https://drive.google.com/file/d/1AeuRLRsDmN4LCyrSYJDpzphkNCt4jTtZ/view?usp=drive_link),[HW1](https://drive.google.com/file/d/1eaJP3U9GajWhGPGDMKVlHiJcSHb4VlwL/view?usp=drive_link))|[all](https://youtu.be/kzUJXHD41DI)
|Week 5|3/27|PRG and PRF([slide](https://drive.google.com/file/d/19M6mkJq0feVkuaDZfj-Ov1GdH0pUjZae/view?usp=drive_link), [GGM_ppt](https://docs.google.com/presentation/d/1YrQFYMsk8dpy2jXvs13BhaxIlLUGZVQO/edit?usp=drive_link&ouid=114163345387795986070&rtpof=true&sd=true))|[all](https://youtu.be/uiwdKXFQT80)|

## 成績評量 與 課程規定

#### 作業(55%)
* Homework 0 (5%)
* Homework 1-5 (50%)
* Submit both pdf and tex file (In Latex format)
* 可畫圖 (手繪 or latex template)
* 作業遲交，最晚到下週二(23:59)，並分數以 9 折計算；超過則以 0 分計算。

#### 作業LLMs policy
* You may use AI however you wish to deepen your understanding of
the lecture material. Upload the notes, talk to your AI about them,
ask for more explanation or examples; it’s all fine. You may not use
LLMs in any way to work on your homework. You may not upload
assignments, ask for hints, ask how certain concepts from the lectures
might be applied to specific homework problems, or upload your
assignments to check for correctness or clarity or anything else. You
may not include any AI generated content whatsoever in your homework
submissions (This policy is taken from MIT 6.5620).
* We will use a random-checking policy in which students may be asked
to present their homework solutions during TA office hours, with the
expectation that everyone will present at least once. Evaluation is
based on consistency, meaning students must be able to reproduce the
solutions they originally submitted. If a student fails this consistency
check, they will receive a significant percentage deduction from their
homework score.

#### Scribe (10%)
* 可畫圖，中/英文皆可
* 禁止使用任何LLMs來完成你的Scribe
* Scribe內容的順序需要遵循今年上課流程
* TA會開一個Overleaf Project邀請需要Scribe的學生加入
* 隔週上課前（週四 23:59)，在TA創建的Overleaf Project完成一個初步的版本，助教同時
會把Scribe的連結放到課程網站，每個人需要自己獨立完成一份Scribe(學號.tex)
* 在完成初版後，TA會給出對應的建議(TA透過email通知)，同學需要配合TA在學期間完善Scribe
* 有的Project裡會包含之前學生品質比較好的Scribe。如果是這個情況，學生以補充完善之前
Scribe內容為主
* 可(且鼓勵)Scribe超過一次，如超過將採較高分計算，並視情況斟酌加分
- Scribes of [2023](https://hackmd.io/@csie-tamc/Syiol5A5s) and [2022](https://hackmd.io/@csie-tamc/SJTFrm3RF)

#### 期中考 (20%)

#### Group Project (20%)
* [參考主題列表(不定時更新中)](https://docs.google.com/document/d/1ZzrmEc4dcNYe4Bi6ReMKXavITFzWMUVv9FvGFk363MY/edit?usp=share_link)
* Project lists of [2024](https://docs.google.com/spreadsheets/d/1sV8Sq0Tj-rhcMoFO5L22CpMJxCxHzFeqX2rCCw8KCsc/edit?gid=105955549#gid=105955549), [2023](https://docs.google.com/spreadsheets/d/1gT8q5hfa8WugerA4YgDc_0ZVny2jNscUylNzuiu25wM/edit) and [2022](https://hackmd.io/@csie-tamc/SJTFrm3RF)
* Some Resources
* Crypto Conference: [2025](https://crypto.iacr.org/2025/program.php), [2024](https://crypto.iacr.org/2024/program.php), [2023](https://crypto.iacr.org/2023/program.php), [2022](https://crypto.iacr.org/2022/program.php)
* Eurocrypt Conference: [2025](https://eurocrypt.iacr.org/2025/program.php), [2024](https://eurocrypt.iacr.org/2024/program.php), [2023](https://eurocrypt.iacr.org/2023/program.php), [2022](https://eurocrypt.iacr.org/2022/program.php)
* Asiacrypt Conference: [2025](https://asiacrypt.iacr.org/2025/program.php), [2024](https://asiacrypt.iacr.org/2024/program.php), [2023](https://asiacrypt.iacr.org/2023/program.php), [2022](https://asiacrypt.iacr.org/2022/program.php)
* Theory of Cryptography Conference:[2025](https://tcc.iacr.org/2025/program.php), [2024](https://tcc.iacr.org/2024/program.php), [2023](https://tcc.iacr.org/2023/program.php), [2022](https://tcc.iacr.org/2022/program.php)
* [PQCRYPTO Mini-School 2022](https://troll.iis.sinica.edu.tw/school22/programme.shtml)
* [Elliptic Curve Cryptography 2024](https://troll.iis.sinica.edu.tw/ecc24/index.shtml)

## References
- **Jonathan Katz and Yehuda Lindell**
[Introduction to Modern Cryptography](http://www.cs.umd.edu/~jkatz/imc.html)
Chapman & Hall/CRC Press, 2007
- **Rafael Pass and Abhi Shelat**
[A course in Cryptography](https://www.cs.cornell.edu/courses/cs4830/2010fa/lecnotes.pdf), 2010
- **Vadim Lyubashevsky**
[Basic Lattice Cryptography: The concepts behind Kyber (ML-KEM) and Dilithium (ML-DSA)](https://eprint.iacr.org/2024/1287), 2024