
T79.5501 Cryptology (5 cr) L
Spring 2008
[General Information]
[Lectures]
[Exercises]
[Other Interesting Stuff]
[TOPI]
Previous years:
[Autumn 2005][Spring 2007]
The course T79.5501 replaces the earlier course T79.503: Foundations of Cryptology
[Autumn
2004]
The course deals with the mathematical basis of modern cryptographic
algorithms. It can be taken as a special course in advanced level
undergraduate and graduate studies of computer science and
mathematics.
General Information
 Lectures by Prof. Kaisa Nyberg: Tuesdays 1214, hall T4,
starting from the 22th of January. Lectures are held in English and all additional material is provided in English. Exams can be taken in Finnish, Swedish or English.
 Exercise session :
Assistant is M.Sc. Risto Hakala for period III, and M.Sc. Billy Brumley for period IV. Exercises will start the 29th of January.
 Course material:
 Textbook
Douglas R. Stinson:
Cryptography, Theory and Practice,
Chapman & Hall/CRC Press, Boca RatonLondonNew York,
Third Edition, 2006
 Other material
Additional material will be given.
 To pass the course, choose one of the two alternative ways:
 take two midterm exams, one in March and one in May; or
 to take the final exam in May.
If you pass the course using midterm exams, but are unhappy with your grade, you can try to make it up by taking the final exam.
Additional points (max. 6 pts.) for the midterm exams can be obtained by doing homework exercises and participating in the exercise
classes. Exercises are not mandatory but strongly recommended. Exercise credit points cannot be used for the final exam.
 Newsgroup: opinnot.tik.krypto
 Dates of the exams:
 The first midterm exam: Tuesday, the 11th of March at 1316 in T1. The date has changed!
 The second midterm exam: Friday, the 9th of May at 1316 in T1. The date has changed!
 The final exam: Thursday, the 15th of May at 1316 in T1
 Recommended courses:
 T79.4501 Cryptography and Data Security or T110.5210 Cryptosystems
 Mat1.2991 Discrete Mathematics
 Mat1.3081 Algebra I
 Mat1.3111 Number theory
Back to menu.
Lecture Notes
The first midterm exam area ends here. The exam is based on the lectures and exercises. The sections covered from the textbook are 1.2, 2 and 3.
Midterm break. The first midterm exam: Tuesday, the 11th of March at 1316 in T1. Here you find the exam problems , exam solutions , and results .
 Lecture 7 (April 1) slides , and addendum .
 Lecture 8 (April 8) slides
 Lecture 9 (April 15)
The material for this lecture comprises of the following sections from the text book:
 5.7.3 Wiener's Low Decryption Exponent Attack Wiener's algorithm
 5.8 The Rabin Cryptosystem, see also Lecture 8 slides
 6.1 The ElGamal Cryptosystem
 6.2.1 Shanks' algorithm
 Lecture 10 (April 22)
The material of this lecture comprises of the following sections from the text book:
 6.2.3 The PohligHellman Algorithm
 11.2 The DiffieHellman Key Agreement
 7.1 Signature Schemes, Introduction
 7.2 Sequrity Requirements for the ElGamal Signature Scheme
 7.3 The ElGamal Signature Scheme
 7.4 Variants of the ElGamal Signature Scheme
 Lecture 11 (April 29)
The topic of this week is elliptic curves, Sections 6.5 and 7.4.3.
 Lecture 12 (May 6)
cancelled
Course ends. The second midterm exam: Friday, the 9th of May at 1316 in T1. NEW! Here you find the exam problems and the results of the 2. midterm exam.
NEW! Here you find the final results of the course .
Final exam
The final exam: Thursday, the 15th of May at 1316 in T1
Here are the
exam problems both in Finnish and English,
and here are the
exam results.
If you have questions about grading, send email to Kaisa Nyberg, kaisa.nyberg AT tkk.fi.
Back to menu.
Exercises
Students are encouraged to solve the exercise problems by themselves
prior to the respective exercise session. In the beginning of each
session, students indicate which problems they have solved and are prepared to present to the class. The number of bonus points (N) is determined based on the total number (T) of solutions indicated by a student using the formula:
N = min(6, (T  8.5)/7)
rounded up or down to the nearest integer. For example, the least T to achieve N = 6 is T = 47.
NEW! The bonus points from the exercises in Spring 2008 are in this list .
The exercise problems are available as PDF files.
The area of the first midterm exam ends here.
Back to menu.
Course Feedback
Feedback is collected centrally in
Finnish,
Swedish, or
English.
Back to menu.
Other Interesting Stuff
Exam Calculator Policy: If not otherwise stated in the problem sheet of the exam, it is allowed to use function calculator, however not any programmable calculator.
Back to menu.
[TCS main]
[Contact Info]
[Personnel]
[Research]
[Publications]
[Software]
[Studies]
[News Archive]
[Links]
Latest update: 13 June 2008.
Kaisa Nyberg.
