Cryptography 2010/2011 | ||
News | Dates | Grading | Content | Exercises | Material | Programming Project |
Mock exam from 10.2.2011: [PDF]
Annotated mock exam from 10.2.2011 [PDF]
Disclaimer: The annotations are provided "as is" with no claim of correctness or completeness. Especially, the notes given on the chalk board have not been added.
Note: Exercise sheet 6 contained some typos and errors. We uploaded a new version that hopefully fixes most of them.
Exercises are voluntary and do not account for the final grades.
- Homework 01: [PDF] Ciphertexts: ex1_1.txt ex1_2.txt Solution: here
- Homework 02: [PDF] Solution: here
- Homework 03: [PDF] Solution: here
- Homework 04: [PDF] Solution: here
- Homework 05 ( with additional exercise ): [PDF] Solution: here
Erratum : In the solution of exercise 1, part e): i) should read as F_k(c^(0)_1 (+) [3n] (+) [n] (+) [3n]) = F_k(c^(0)_1 (+) [n]) (or: replace c^(0)_1 by c^(0)). In the recent version this error is already corrected. Thanks for the pointer! - Homework 06 (typos fixed): [PDF] Solution: here
Erratum : In exercise 6.2 d): The result is 243^173 mod 323 = 3, in the recent version this error is already corrected. Thanks again for the pointer!
- Questionnaire 1: [PDF]
- Questionnaire 2: [PDF]
- Questionnaire 3: [PDF]
- Questionnaire 4: [PDF]
- Questionnaire 5: [PDF]
- Questionnaire 6: [PDF]
The sum of all obtainable points for the questionnaires was 31. We divided your total number of points by 28 (this should "simulate" one absence during a lecture with questionnaire :) and used this fraction for computing your bonus.
Note: We would be very grateful if you report found errors in the solutions to the exercises to us.
Who finds the most errors will receive a small surprise at the end of the last lecture :)