Nada

Seminariekurs i teoretisk datalogi, 4 poäng
period 4 02/03

The course is taught in Swedish. Essentially all written material in connection with the course will be available in English.

News

Course evaluation.

Notes from the lecture of Susan Ström and Oskar Wiksten on network security and cryptography are available, also as pdf.

The voting mentioned below is complete and we now have a list of topics that will be covered. As the speed of lectures depends on the audience and the lecturer the last topics might not be covered or might be covered in student lectures possibly outside the already scheduled lectures.

For each topic we will have a scribe taking notes to produce a transcript of the lecture, preferably in LaTeX. After a screening by the lecturer these notes will be published at this website.

A preliminary list of topics that might be discussed in the course is available. As a guidance which topics to cover please send me a list of your votes on each of the subjects. On each topic you may vote -1, 0 or 1. As the lectures for the first three topics are already prepared and the topics are important for the course, these topics are likely to be covered.

Lecture notes

Notes on zero knowledge . Available also as pdf.

Notes on elliptic curves . Available also as pdf.

Notes on lattices and lattice basis reduction. Available also as pdf. These notes are taken from the lecture notes in the course advanced algorithms and hence are not an exact transcript of the lecture.

Notes on Cramer-Shoup cryptosystem. Available also as pdf.

Notes on security of encryption. Available also as pdf.

Notes on pseudo-random functions. Available also as pdf.

Notes on some probabilistic lemmas. Available also as pdf.

Notes from the lectures on assumptions. Available also as pdf.

Notes from the lectures on pseudorandom number generators. Available also as pdf.

Lecturer

Johan Håstad is responsible for all aspects of this course. Additional help might be needed for correcting homeworks.

Checking in

Log unto a unix computer at nada and give the following two commands

res checkin semteo05
course join semteo05

If you do not do this your results cannot be reported and you might miss vital information related to the course.

Homework

Homeworks are offered as a possibility for passing the course. If desired other forms of examination are be possible as a complement/substitute. Giving a seminar of writing a summary of some research papers are examples of such alternatives. If desired, contact Johan Håstad.

Please note the rules that apply to the homework. The rules are the same that Mikael Goldmann used in the basic cryptography course. You can find a copy of his rules here. The code of honours of course also applies.

The second set is now available, also in pdf. Hopefully slightly easier than the first. Slots for correcting the second homework are now available.

The first set should already have been completed. Also available in pdf.

Grading

A total of 2/3 on the homeworks will surely be sufficient for a grade "5", 1/2 a grade "4" and 1/3 to pass the course. The first homework is on the difficult side and unless the second set is significantly easier some discount will be given.

Having done a set of notes gives credit towards all grades. The amount of credit depends on the set of notes and corresponds to between 1/6 and 1/3 of the total score on one homework set. In other words, two big set of notes would be sufficient to pass the course.

Schedule

 F ti 15-17 v 12-15, 19-21   E53 
 F to 10-12 v 13   E2 
 F to 10-12 v 14   D34 
 F to 10-12 v 15   E35 
 F to 10-12 v 11-12,19-21   D33 

Sidansvarig: <johanh@nada.kth.se>
Senast ändrad 9 november 2010
Tekniskt stöd: <webmaster@nada.kth.se>