Nada

Kryptografins grunder, 4 poäng
period 3 04/05

News

The course evaluation has now been completed, unfortunately only 7 replies but you find it here. There is also a course analysis (in Swedish).

Lecturer

Johan Håstad, is responsible for all aspects of this course. Some graduate student(s) will help in correcting the homework assignments, and there will be at least one guest lecture (by Mats Näslund, Ericsson). The lectures will be given in Swedish but all other material connected to the course will be in English.

Checking in

When time comes. Log unto a unix computer at nada and give the following two commands

res checkin krypto05
course join krypto05

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

Handouts

Lecture notes notes from the lecture on pseudorandom number generators has been (also as pdf).

A lecture given by Mats Näslund from Ericsson on February 23. It is a power point presentation.

The course PM, also as pdf.

A description of the G-writer, also as pdf.

Homework

Third homework, also as pdf.

External files for homework3 : unknown3, unknown4, ser1, ser2, ser3, ser4, ser5

Second homework, also as pdf.

First homework, also as pdf.

External files for homework1 : unknown1, unknown2, gskriv, gskriv2, SubByte.

Instructions on how to turn in AES programs can be found here. We do have an example of the files plain and cipher (also available in a zip-file) with the key given in the statement of homework 1. The format is a raw binary file. It is easy to find other examples on the net.

The homework sets are supposed to be challenging, and even getting a passing grade (the grade 3) will require some effort. Keep in mind however that you do not have to solve all the problems even to get a good grade. The idea is that it is better to solve some of the problems well than to solve all the problems partially, and solutions will be graded with this in mind.

There will be three sets of homework which will be due on February 4, 18 and March 4 respectively.

Please note the rules that apply to the homework. Be sure to read both the homework rules and the code of honors before you start working on the problems!

Course book

We recommend "William Stallings: Cryptography and Network Security", Prentice Hall.

As a first alternative, there is "Menezes et al.: Handbook of applied cryptography". This book is available electronically. Visit its homepage. Study the copyright notice. Note that, regardless of the copyright notice, you may not use a printer at KTH to print out a copy of this book.

As a second alternative there is the old course book by Douglas Stinson: Cryptography, Theory and Practice, Chapman & Hall /CRC.

For the student interested in more details and depth about the theoretical foundations of cryptography we recommend Foundations of Cryptography by Oded Goldreich.

Lectures

We have now made a list of what happened, at the lectures together with some pointers to litterature.

Schedule

 F 8-10 v 3-5   E3 
 F on 15-17 v 3-8   E2 
 F fr 10-12 v 3-8   E2 

Links


Sidansvarig: <johanh@nada.kth.se>
Senast ändrad 25 april 2005
Tekniskt stöd: <webmaster@nada.kth.se>