Will be discussed with the students. There will be homework and presentations by the students. There is no written exam.
DD2542 Seminars on Theoretical Computer Science, Algorithms and Complexity 7.5 credits

The topic of the course 2026 is modern cryptography. The format and exact content of the course will depend on the number of students and their preferences. It will be a combination of standard lectures by the leader of the course and seminars held by the participants. The focus will be on theory and provable constructions but practical aspects might also be discussed.
We start with classical resluts such as construction pseudorandom functions from pseudorandom generators. We we also give digital signatures based on one-way functions. The later part of the course will discusss more modern constructions such as homomorpic encryption, identity-based encryption and obfuscation.
Information per course offering
Course offerings are missing for current or upcoming semesters.
Course syllabus as PDF
Please note: all information from the Course syllabus is available on this page in an accessible format.
Course syllabus DD2542 (Autumn 2021–)Content and learning outcomes
Course disposition
Course contents
The course content may vary from course offering to course offering. Examples on topics are approximation algorithms, data mining, cryptography, parallel computations and probabilistic algorithms.
Intended learning outcomes
After passing the course, the student shall be able to
- discuss advanced concepts within the area of the course
- attack problems within the area of the course actively, both through own work and through search of relevant information
- assimilate and present the essential contents of scientific articles within the area of the course.
Literature and preparations
Specific prerequisites
Completed course in algorithms and complexity equivalent to DD2350/DD2352.
Active participation in a course offering where the final examination is not yet reported in LADOK is considered equivalent to completion of the course.
Registering for a course is counted as active participation. The term 'final examination' encompasses both the regular examination and the first re-examination.
Recommended prerequisites
The course is open to anyone, but the main target audience are advanced Master's students and doctoral students in computer science and mathematics.
Although the formal prerequisites are quite limited, course participants will need mathematical maturity and a willingness to learn new material. For the course in 2026 some background in cryptography is an advantage but not a strict requirement.
Literature
Examination and completion
Grading scale
Examination
- ÖVN1 - Exercises, 7.5 credits, grading scale: A, B, C, D, E, FX, F
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
If the course is discontinued, students may request to be examined during the following two academic years.
Examiner
Ethical approach
- All members of a group are responsible for the group's work.
- In any assessment, every student shall honestly disclose any help received and sources used.
- In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.
Further information
Course room in Canvas
Offered by
Main field of study
Education cycle
Supplementary information
This course is usually given every second year (even years) in period 1. The language of tuition is English.
The course has replaced DD2442.