Cryptography WS 2013/2014 | ||
News | Dates | Grading | Content | Exercises | Material |
07.03.2014
The retake exam will be oral and take place in the first week of the new semester (Tue/Wed, 8/9th April).Please register in TUMOnline if you want to participate (and please unregister(!) if you change your mind!).
We will then allocate suitable timeslots and send an email to every registered person
(therefore it is very important that you tell us before if you do not want to take the exam any more!).
12.02.2014
Remaining solutions are online now --- happy studying!See the exercise page for a summary if you have achieved the bonus (from the quizzes).
29.01.2014
Exercise sheet 7 and the solution to 6 are both online.16.01.2014
Uploaded most the notes and slides.Also uploaded exercise sheet 6. Will be discussed either on Tuesday or Wednesday next week.
13.01.2014
Solutions for exercise+questionaire 05 are online, points for the questionaires up to q5 as well.08.01.2014
Exam details are online (see "Dates"). You must register for the exam in TUMOnline if you want to participate and please unregister if you change your mind!18.12.2013
Homework 05 is online.13.12.2013
- Fixed the link to the "group theory" slides (was pointing to AES/DES).
-
Fixed some error concerning the "password exercise". (Thanks to Stefan J.)
In case that you're interested what went wrong:
k1 was not unique in [0,106] as 34 is not a generator of ℤ*107 ...
We are going to discuss next Tuesday how to check whether some g is a generator or not, which is quite easy here, as you only have to make sure that neither g2 ≡107 1 nor g53 ≡107 1 holds ... the problem remaining is then to use your calculator correctly.
06.12.2013
Solution for Ex4 and Questionaire 4 are online.02.12.2013
Preliminary results of the questionaires are online (up to Q3---see "exercises" page).27.11.2013
Homework 04 is online.26.11.2013
Solutions for questionaire and homework 03 are online.14.11.2013
Homework 03 is online (sorry for the delay!).07.11.2013
As pointed out in the last lecture (thanks! but the notation is great nevertheless), the (simplified) definition of "semantic secrecy" ruled out all encryption schemes where the ciphertext gives away the length of the underlying plaintext.As in the case of the comp. secrecy, CPA-security, and CCA-security, one has to require that all messages have the same length.
06.11.2013
Solutions for Homework 1+2 and Questionaires 1+2 are online.04.11.2013
The recent Adobe incident teaches a great lesson how NOT to encrypt passwords :) See today's xkcd comic: Click.30.10.2013
Homework 02 is online---please try it till next Tuesday :). A (LaTeX-ed) Solution for Homework 01 will be available soon.30.10.2013
Tutorial on 5.11.13.23.10.2013
The first exercise sheet is now online :).22.10.2013
The links I've mentioned in todays lecture:- Code review of true crypt
- A lecture at Berkeley on attacks (see 4/19 for infected compilers)
- Some further references for cryptography