T-79.5501 Cryptology (5 cr)

Spring 2007

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

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 10-12, hall T4, starting from the 16th 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 12-14, hall T4
  Assistant is Lic.Tech. Miia Hermelin. Exercises will start the 23rd 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: Friday, the 9th of March at 9-13 in T1
  • The second midterm exam: Tuesday, the 7th of May at 9-12 in T1 Note. The date has changed!
  • The final exam: Tuesday, 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 16) notes
• Lecture 2 (Jan 23) notes
• Lecture 3 (Jan 30) notes
  Additional material:
  • Handout 1
  • Handout 2
• Lecture 4 (Feb 6) slides
• Lecture 5 (Feb 13) slides
• Lecture 6 (Feb 20) slides
  Additional material:
  • Handout 3, Boolean functions (an update posted on Feb 27)

• Lecture 7 (Feb 27):
  Additional material:
  • Handout 4, More about finite fields

• Lecture 8 (March 13) notes
• Lecture 9 (March 20) notes and an example of Wiener's Algorithm.
  March 27: No lecture.
• Lecture 10 (April 3) notes
  April 10: Easter holidays. No lecture.
• Lecture 11 (April 17) notes
• Lecture 12 (April 24) notes

Final exam

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 23): problems
• Session 2 (January 30): problems
• Session 3 (February 6): problems. Notation: F* = F\{0}.
• Session 4 (February 13): problems
• Session 5 (February 20): problems
• Session 6 (February 27): problems  

• Session 7 (March 13): problems
• Session 8 (March 20): problems
• Session 9 (March 27): problems   In problem 5, you are free to choose how to make your implementation
• Session 10 (April 3): problems
• Session 11 (April 17):problems
• Session 12 (April 24):problems

Course Feedback

To be opened April 25: We will welcome feedback which is collected centrally in Finnish, Swedish, or English.

Other Interesting Stuff

Exam Oct 24, 2005 pdf
Exam December 14, 2005 Problems in English;  in Finnish;  Solutions