Foundation of cryptographyCourse information
NewsThe course evaluation is now complete and so is the course analysis.. Description of lectures (planned in the future, actual content for past). Contains also some reading pointers to the book of Stinson.
LecturerJohan Håstad is responsible for all aspects of this course. Douglas Wikström will help in correcting the homework assignments, and there might be some guest lecture. The language of the lectures will be decided at the beginning of the course but in any case all written material connected to the course will be in English.Checking inWhen time comes. Log unto a unix computer at CSC and give the following two commands
If you do not do this your results cannot be reported and you will miss vital information related to the course. HandoutsThe course memo. The course analyis from last year (in Swedish).
HomeworkFor correcting the Schnorr signature problem please prepare a file in the directory of the program which contains the following numbers (in this order): q,p,g,x,y,m,r,alpha,gamma,delta. Short description: p is a large prime and q a smaller prime that divides p-1. The number g is a generator of the group of order q, x is the discrete logarithm of the public number y. The message to be signed is coded as the integer m and r is the random number used in the generation of the signature and alpha is g to the power r. The number gamma is the output of the hash function and delta is the other part of the signature. The numbers written in decimal with one number on each line and if you call it numbers then it is easy to find. The second homework is now published. The first homework is now published. Minor clarification 1: An isomorphism is 1-1 mapping. Minor clarification 2: When calculation the entropy on problem 5 you may use other facts we have learned about entropy, apart from the basic formula, in your calculations. Useful files: gskriv, gskriv2, gskrivmod, unknown, Description of the G-writer. There will be two sets of homeworks that will appear here in due time. They will be due on February 13 and March 7 and available at least three weeks prior to these dates. An essential part of the course is to make a presentation of a research paper in cryptography. To get a passing grade on the course such a presentation is required. There is a more detailed description of both these tasks in the homework rules. The homework sets are supposed to be challenging, and even getting a passing grade (the grade E) 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. Be sure to read also the code of honors before you start working on the problems! Course bookWe recommend Stinson: Cryptography, Theory and Practice, Chapman & Hall /CRC, 3rd edition. Another possibility that contains the material of the course is: Trappe, Washington "Introduction to Cryptography, with coding theory", Pearson International.For the student interested in more details and depth about the theoretical foundations of cryptography we recommend Foundations of Cryptography by Oded Goldreich. As many lectures only are small modifications of previous years lectures, the lecture notes from spring 2006 might be helpful.
Schedule
Links
|