Genral instructions
Typeset a short proof similarly to the example provided below
Copy the LaTeX code files into your favourite directory and try to compile it with LaTeX. If this succeeds then modify the corresponding tex file and type in the proof analogously. Send the corresponding LaTeX file together with compiled PDF file to me. In case of problems contact me.
Grading
| HW1 | HW2 | HW3 | Sum | Nominal | % | Points | |
| Andre Ostrak | 3.00 | 3.00 | 6.00 | ||||
| Shiting Long | 2.75 | 1.75 | 6.00 | ||||
| Eric Cornelissen | 2.25 | 2.50 | 6.00 | ||||
| Risto Pärnapuu | 2.75 | 2.50 | 6.00 |
First homework
Deadline: 23th of October 10:15
Boomerang deadline: 30th of October 10:15
- Solve one exercise for each block
- Each exercise gives one point
- You can get an extra point by solvin two exercises from the third block
- Basic reductions
- Statistical properties of distinguishers
- Unpredictability and statistical security
Second homework
Deadline: 28th of November 10:15
Boomerang deadline: 5th of December 10:15
- Solve one exercise for each block
- Each exercise gives one point
- Message authentication and keyed hash functions
- Commitment schemes and hash functions
- Authentication through challenge-response protocols
Under construction! Last years system
Optional third homework
Each of you have to choose one exercise from sets {a,b}, {c,d}, {e,f}, i.e., you have to solve three exercises in total. There are no other restrictions for choosing these exercises
Assigmnents