Kursplan för |
|
TDA351 - Cryptography |
|
Kursplanen fastställd 2012-02-18 av programansvarig (eller motsvarande) |
Ägare: MPALG |
|
7,5 Poäng |
Betygskala: TH - Fem, Fyra, Tre, Underkänt |
Utbildningsnivå: Avancerad nivå |
Huvudområde: Datateknik, Informationsteknik
|
Institution: 37 - DATA- OCH INFORMATIONSTEKNIK
|
Undervisningsspråk: Engelska
Sökbar för utbytesstudenter
Blockschema:
D
Modul |
|
Poängfördelning |
|
Tentamensdatum |
Lp1 |
Lp2 |
Lp3 |
Lp4 |
Sommarkurs |
Ej Lp |
0107 |
Tentamen |
7,5 hp |
Betygskala: TH |
|
|
7,5 hp
|
|
|
|
|
|
20 Dec 2012 em H, |
05 Apr 2013 fm V |
0207 |
Laboration |
0,0 hp |
Betygskala: UG |
|
|
0,0 hp
|
|
|
|
|
|
|
I program
TKDAT DATATEKNIK, CIVILINGENJÖR, Årskurs 3 (valbar)
TKITE INFORMATIONSTEKNIK, CIVILINGENJÖR, Årskurs 3 (valbar)
MPALG COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Årskurs 1 (obligatoriskt valbar)
MPALG COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Årskurs 2 (valbar)
MPCAS COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Årskurs 2 (valbar)
MPCSN COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Årskurs 1 (valbar)
Examinator:
Univ lektor
Björn von Sydow
Ersätter
TDA350
Kryptoteknik
Kursutvärdering:
http://document.chalmers.se/doc/89ccf4fd-d7c3-4f74-87c0-a4c4722e43a3
Gå till kurshemsida
Behörighet:
För kurser inom Chalmers utbildningsprogram gäller samma behörighetskrav som till de(t) program kursen ingår i.
Kursspecifika förkunskaper
General programming skills (C, Java or Haskell).
Discrete mathematics (modular arithmetic, basic probability theory).
Data structures.
Syfte
The course aims to provide an overview of cryptographic concepts, primitives, protocols and applications.
Lärandemål (efter fullgjord kurs ska studenten kunna)
* 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
Innehåll
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.
Litteratur
See separate literature list.
Examination
Compulsory home assignments and written exam.