Program Overview

Course Description

The course DD2448 Foundations of Cryptography is a 7.5 credit course that comprehensively introduces the key principles behind cryptographic systems, from classic methods to modern encryption standards. Students will gain a solid foundation in symmetric and asymmetric encryption techniques, cryptographic hash functions, and the role of randomness in security systems.

Information per Course Offering

Spring 2026

• Course location: KTH Campus
• Duration: 16 Mar 2026 - 1 Jun 2026
• Periods: Spring 2026: P4 (7.5 hp)
• Pace of study: 50%
• Application code: 60233
• Form of study: Normal Daytime
• Language of instruction: English
• Number of places: Places are not limited
• Target group: CLGYM and students admitted to a master's programme as long as it can be included in your programme.
• Planned modular schedule: P4: H1, J1, C2, I2.

Course Syllabus

Content and Learning Outcomes

Course Contents

• Classic cryptosystems
• Symmetric encryption algorithms such as Advanced Encryption Standard (AES)
• Open key systems for encryption and digital signatures e.g. RSA, ElGamal and Schnorr signatures
• Cryptographically secure hash functions in theory and practice (SHA)
• Properties and examples of pseudo-random number generators
• Connections to complexity theory

Intended Learning Outcomes

After passing the course, the student shall be able to:

• Discuss the following basic concepts in cryptography: symmetric and asymmetric encryption, digital signatures, cryptographic hash functions, and strong pseudo-random number generator
• Give examples of the above concepts
• Perform simple own analyzes of cryptographic constructions such as cryptographic systems and cryptographic protocols
• Determine the reliability of analyzes of cryptographic constructions such as cryptographic systems and cryptographic protocols
• Summarize the content of technical articles on cryptography and cryptographic protocols

Literature and Preparations

Specific Prerequisites

• Knowledge of Algorithms and Data Structures, 6 credits, equivalent to completed course DD1338/DD1320-DD1328/DD2325/ID1020/ID1021.
• Knowledge of algorithms and complexity, 7.5 credits, equivalent to completed course DD2350 / DD2352.
• Knowledge of discrete mathematics, 7.5 credits, equivalent to completed course SF1610/SF1630/SF1662/SF1679/SF1688.
• Knowledge in probability theory and statistics, 6 credits, equivalent to completed course SF1910-SF1925/SF1935 or completed TEN1 within SF1910/SF1925/SF1935.
• Knowledge of algebra and geometry, 7.5 credits, equivalent to completed course SF1624/SF1672/SF1684.
• Knowledge in one-variable calculus, 7.5 credits, equivalent to completed course SF1625/SF1673/SF1685.
• Course from Upper Secondary School equivalent to the Swedish upper secondary course English B/6.

Recommended Prerequisites

• Knowledge equivalent to either one of the courses DD1352 Algorithms, Data Structures and Complexity or DD2354 Algorithms and Complexity and knowledge of probability theory, mathematics and algorithm theory acquired in the mandatory courses of the D or F program.

Examination and Completion

Grading Scale

• A, B, C, D, E, FX, F

Examination

• GRU1 - Group work, 2.5 credits, grading scale: P, F
• INDA - Individual home assignment, 5.0 credits, grading scale: A, B, C, D, E, FX, F

Further Information

Offered by

• EECS/Computer Science

Main Field of Study

• Computer Science and Engineering

Education Cycle

• Second cycle

Supplementary Information

• The course is held in English if the students wish so.
• You cannot count both DD2448 and DD2449 in your exam, since DD2448 has replaced DD2449.
• In this course, the EECS code of honor applies.