Search course

Syllabus for	Academic year 2022/2023 2021/2022 2020/2021 2019/2020 2018/2019 2017/2018 2016/2017 2015/2016
TDA352 - Cryptography
Kryptografi
Syllabus adopted 2019-02-08 by Head of Programme (or corresponding)
Owner: MPALG
7,5 Credits
Grading: TH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail
Education cycle: Second-cycle
Major subject: Computer Science and Engineering, Software Engineering
Department: 37 - COMPUTER SCIENCE AND ENGINEERING

Teaching language: English
Application code: 02121
Open for exchange students: Yes
Block schedule: D

Module

Credit distribution

Examination dates

Sp1

Sp2

Sp3

Sp4

Summer course

No Sp

0115

Laboratory

1,5 c

Grading: UG

1,5 c

0215

Examination

6,0 c

Grading: TH

6,0 c

15 Jan 2021 am L

08 Apr 2021 am J,

27 Aug 2021 am J

In programs

TIDAL COMPUTER ENGINEERING - Common branch of study, Year 3 (compulsory elective)
MPCAS COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 2 (elective)
MPCSN COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 2 (elective)
MPCSN COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 1 (elective)
TKITE SOFTWARE ENGINEERING, Year 3 (elective)
MPALG COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Year 2 (elective)
MPALG COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Year 1 (compulsory elective)

Examiner:

Aikaterini Mitrokotsa

  Go to Course Homepage

Eligibility

General entry requirements for Master's level (second cycle)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Specific entry requirements

English 6 (or by other approved means with the equivalent proficiency level)
Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.

Course specific prerequisites

General programming skills (C, Java or Haskell).
Discrete mathematics (modular arithmetic, basic probability theory).
Data structures.

Aim

The course aims to provide an overview of cryptographic concepts, primitives, protocols and applications.

Learning outcomes (after completion of the course the student should be able to)

• summarize the main goals of cryptography and illustrate this with a number of examples of how cryptographic services are integrated in current applications, both in software and hardware
• describe goals and design principles for and common structures of secret key primitives such as block and stream ciphers and message authentication codes
• identify, analyse and explain various forms of attacks based on improper usage of primitives, modes or protocols
• explain how basic public key primitives can be defined based on the difficulty of mathematical problems such as the discrete logarithm problem or factoring and analyse variants of these systems
• explain the various roles of hash functions as parts of other cryptographic primitives and protocols and the requirements this places on hash functions
• exemplify when various notions of security, such as information- theoretic, computational, provable and practical security, are applicable and describe the security guarantees provided
• explain basic key management techniques in both secret key and public key cryptography

Content

Basic goals of cryptography (confidentiality, authentication,
non-repudiation). Symmetric key cryptography: block and stream ciphers,
design principles and examples, modes of operation, message
authentication codes. Public key cryptography: asymmetric ciphers,
signatures. Attack models and security notions. Protocols for key
management, authentication and other services.

Organisation

Teaching consists of lectures, problem-solving sessions and feedback on home assignments.

Literature

More information is available on the course homepage.

Examination including compulsory elements

Compulsory home assignments and written exam. Based on the result of the exam you will receive the grades: U, 3, 4 , or 5.