Syllabus for |
|
| TDA351 - Cryptography |
| |
| Syllabus adopted 2011-02-24 by Head of Programme (or corresponding) |
| Owner: MPALG |
|
|
7,5 Credits |
| Grading: TH - Five, Four, Three, Not passed |
| Education cycle: Second-cycle |
|
Major subject: Computer Science and Engineering, Information Technology |
|
Department: 37 - COMPUTER SCIENCE AND ENGINEERING
|
Teaching language: English
| Course module |
|
Credit distribution |
|
Examination dates |
|
Sp1 |
Sp2 |
Sp3 |
Sp4 |
Summer course |
No Sp |
| 0107 |
Examination |
7,5c |
Grading: TH |
|
|
7,5c
|
|
|
|
|
|
10 Dec 2011 am V, |
13 Apr 2012 pm V |
| 0207 |
Laboratory |
0,0c |
Grading: UG |
|
|
0,0c
|
|
|
|
|
|
|
In programs
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)
MPCAS COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 2 (elective)
MPCOM COMMUNICATION ENGINEERING, MSC PROGR, Year 2 (elective)
MPCSN COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 1 (elective)
TKDAT COMPUTER SCIENCE AND ENGINEERING, Year 3 (elective)
TKITE SOFTWARE ENGINEERING, Year 3 (elective)
Examiner:
Univ lektor
Björn von Sydow
Replaces
TDA350
Cryptography
Course evaluation:
http://document.chalmers.se/doc/1922224916
Go to Course Homepage
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
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
See separate literature list.
Examination
Compulsory home assignments and written exam.