Exercises
Some exercises will require theory that will not be lectured. You should read the required theory on your own. If no references are given, you will find the material in the lecture notes. DH, SYM, PKE, SHOR, LAT and SIG refer to the lecture notes.
BS refers to the notes of Boneh and Shoup.
Some of the exercises will be in the Department of Mathematical Sciences' student computer lab.
The exercises are not obligatory, but they are essential for learning.
| Week | Date | Exercises | Old exams | Notes |
|---|---|---|---|---|
| 34 | 21.08. | SYM 2, 6, 9 | Problem 1a from 2016 | |
| 35 | 28.08. | See Blackboard | ||
| 36 | 04.09. | BS 4.13 (a), SYM 29 | Pls repeat the 1st part of today's lecture | |
| 37 | 11.09. | BS 4.13 (b), 6.3, 6.17 | ||
| 38 | 18.09. | BS 8.4, 9.2, 9.13 | ||
| 39 | 25.09. | BS 10.4, 10.5, 10.14 | ||
| 40 | 02.10. | BS 11.5 (b), 11.8, 11.14 (c ) | ||
| 41 | 09.10. | BS 11.2, 11.3, 10.26 | We will present BS 11.1 next week which is a generalization of 11.2. BS 11.1 – 11.3 can help you to be familiar with basic proof techniques in the ROM | |
| 42 | 16.10. | (See "Notes" or Blackboard) | 1. Go through once again the proof of "CDH –> Twin DH" and Exercise 10.14. 2. Show that the twin DH assumption implies the CCA1 security of Twin Hashed ElGamal (Hints: Similar to the one for Hashed ElGamal). (Remark: These two homeworks will lead to the answer to Exercise 12.31. But please finish the above two homeworks before you look into Exercise 12.31.) | |
| 43 | 23.10. | BS 13.10, 13.12 (a to c) | 13.10: Forget about making your proof tight. Any sound proof is enough. 13.12: You can consider the RSA function as the trapdoor permutation. | |
| 44 | 30.10. | Problem 1a and 2a from 2019 |