T-79.5501 Cryptology (5 cr) L

Spring 2008

[General Information] [Lectures] [Exercises] [Other Interesting Stuff] [TOPI]

Previous years: [Autumn 2005][Spring 2007]

The course T-79.5501 replaces the earlier course T-79.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 12-14, 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 :
  • Tuesdays 14-16, hall T4
  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 Raton-London-New York,
    Third Edition, 2006
  • Other material
    Additional material will be given.
• To pass the course, choose one of the two alternative ways:
  1. take two midterm exams, one in March and one in May; or
  2. 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 13-16 in T1. The date has changed!
  • The second midterm exam: Friday, the 9th of May at 13-16 in T1. The date has changed!
  • The final exam: Thursday, the 15th of May at 13-16 in T1
• Recommended courses:
  • T-79.4501 Cryptography and Data Security or T-110.5210 Cryptosystems
  • Mat-1.2991 Discrete Mathematics
  • Mat-1.3081 Algebra I
  • Mat-1.3111 Number theory

Lecture Notes

• Lecture 1 (Jan 22)
• Lecture 2 (Jan 29) slides
• Lecture 3 (Feb 5)
slides; Multiplicative property of the phi-function
• Lecture 4 (Feb 19) slides. Updated Mon Feb 25: Theorem 2* added.
• Lecture 5 (Feb 26) slides (Berlekamp-Massey Algorithm); slides (linear cryptanalysis).

• Lecture 6 (March 4) slides .

Midterm break. The first midterm exam: Tuesday, the 11th of March at 13-16 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 Pohlig-Hellman Algorithm
  • 11.2 The Diffie-Hellman 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

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

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.

The exercise problems are available as PDF files.

• Session 1 (January 29) problems  solutions
• Session 2 (February 5) problems; solutions
• Session 3 (February 19) problems; solutions
• Session 4 (February 26) problems [Hint (posted Mon Feb 25): In problem 1 you may find Theorem 2* in Lecture 4 useful.]; solutions
• Session 5 (March 4) problems; solutions

• Session 6 (March 18) problems; solutions .
• Session 7 (April 1) problems . There is no lecture covering this topic (except partially Lecture 3 slides). More material for self study can be found in Section 5.2.3 and 6.4 of the textbook, and here . Solutions.
• Session 8 (April 8) problems. Solutions.
• Session 9 (April 15) problems. Solutions.
• Session 10 (April 22) problems. Solutions.
• Session 11 (April 29) problems. Solutions.
• Session 12 (May 6)problems. Solutions.

Course Feedback

Feedback is collected centrally in Finnish, Swedish, or English.

Other Interesting Stuff