Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

Syllabus for

Academic year
TDA350 - Cryptography
 
Owner: TDATA
4,0 Credits (ECTS 6)
Grading: TH - Five, Four, Three, Not passed
Level: C
Department: 37 - COMPUTER SCIENCE AND ENGINEERING


Teaching language: Swedish

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 No Sp
0101 Examination 4,0 c Grading: TH   4,0 c   12 Dec 2005 pm V,  18 Apr 2006 am V,  23 Aug 2006 am V
0201 Laboratory 0,0 c Grading: UG   0,0 c    

In programs

TM Teknisk matematik, Year 2 (elective)
TTFYA ENGINEERING PHYSICS, Year 4 (elective)
TITEA SOFTWARE ENGINEERING, Year 4 (elective)
TITEA SOFTWARE ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING - Computer security, Year 4 (compulsory)
TDATA COMPUTER SCIENCE AND ENGINEERING, Year 3 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING - Algorithms, Year 4 (elective)
TDATA COMPUTER SCIENCE AND ENGINEERING - Communications System, Year 4 (elective)
DCMAS MSc PROGR IN DEPENDABLE COMPUTER SYSTEMS, Year 1 (elective)
TELTA ELECTRICAL ENGINEERING, Year 4 (elective)

Examiner:

Univ lektor  Björn von Sydow



Eligibility:

For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.

Course specific prerequisites

Basic skills in programming (e.g. Object oriented programming or similar) paired with a solid grounding in probability theory, discrete mathematics and statistics is strongly reommended for the interested student.

Aim

This course provides general insights into cryptographic techniques together with a overview of currently prevailing cryptographic technologies.

Content

As IT becomes ever more important in society it becomes more important to study how to achieve security goals, e.g. confidentiality in telecommunication and authenticuty in electronic commerce. Basic methods for this, cryptosystems and protocols, is the focus of this course; it is natural also to include cryptanalysis (how to brak cryptosystems). The course covers topics from theory to practice, reflecting the broad importance of cryptography. By learning how to brak classical systems we get hands on knowledge of the elements of modern cryptography as well as of its weaknesses. By studying which properties of classical systems that form the basis of attacks we are lead to the design notions of confusion and diffusion. The classical cases also show the importance of statistical methods in order to hide/expose information. Information theory allows us to clarify when perfectly security can be achieved.
We treat in detail some current algorithms for stream and block ciphers. Commonly used symmetric systems such as A5 in GSM cellular phones and DES/AES are presented, as well as current cryptanalysis.
Open key systems provides confidentiality without the need for secret encryption keys. They revolutionized cryptography in the 1970-ies and are now indispensible. We cover basic notions and current algorithms such as RSA, including the relevant number theory.
Current cryptography has much broader scope than just confidentiality, which is not enough if, e.g. messages are exchanged with an attacker masquerading as a legitimate party. Cryptographic protocols aim at achieving these aims by specifying the steps needed to exchanges messages. We study different goals and their protocols.

Organisation

Teaching consists of lectures, tutorial session and lab supervision.

Literature

Course literature is announced on the course web site before course start.

Examination

Home assignments and written exam.
Grading: Fail, 3, 4 or 5.


Page manager Published: Mon 28 Nov 2016.