This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
Module version of SS 2012
There are historic module descriptions of this module. A module description is valid until replaced by a newer one.
Whether the module’s courses are offered during a specific semester is listed in the section Courses, Learning and Teaching Methods and Literature below.
|available module versions|
|SS 2017||SS 2012||WS 2011/2|
IN2197 is a semester module in German or English language at Bachelor’s level and Master’s level which is offered in winter semester.
This Module is included in the following catalogues within the study programs in physics.
- Catalogue of non-physics elective courses
|Total workload||Contact hours||Credits (ECTS)|
|150 h||60 h||5 CP|
Content, Learning Outcome and Preconditions
++ Definitions of security: perfect secrecy, computational security (IND-CPA,IND-CCA,IND-CC2), semantic security
++ Cryptographic primitives and pseudorandomness: pseudorandomnumbergenerators (PRG), -functions (PRF) and -permutations (PRP), one-way functions (OWF) and -permutations (OWP) (with trapdoor (TDP)), crypotgraphic hashfunktions, tweakable blockciphers (TBC)
++ Basics of group- and number theory, and elliptic curves
- Symmetric cryptography:
++ Blockcipher: AES, DES
++ Construction of encryption schemes using blockciphers: rOFB, rCTR, rCBC, OCB
++ Construction of message-authentication-codes: CBC-MAC, NMAC, HMAC
- Asymmetric cryptography:
++ The RSA-problem and derived encryption and signature schemes: RSA-OAEP, RSA-FDH, RSA-PSS
++ The discrete logarithm and derived schemes: Diffie-Hellman protocol, El Gamal, DH-KEM, DSA
- remember the basic primitives used in symmetric and asymmetric cryptography, and
- understand their theoretical foundations,
- analyse cryptographic schemes derived from these primitives,
- understand the basic definitions of security.
Courses, Learning and Teaching Methods and Literature
Courses and Schedule
Responsible/Coordination: Esparza Estaun, F.
Wed, 14:00–16:00, MI 03.09.014
Tue, 16:00–18:00, MI 03.09.014
Learning and Teaching Methods
- Lecture Notes on Cryptography, S. Goldwasser, M. Bellare, online version
- Einführung in die Kryptographie, Johannes Buchmann, Springer Verlag, 4. erweitere Auflage, 2007
- Elliptic Curves: Number Theory and Cryptography, Lawrence C. Washington, Chapman&Hall/CRC, 2nd edition, 2003
- Handbook of Applied Cryptography, Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, CRC Press, 1996
Description of exams and course work
The exercises of the exam test if the examinee has acquired a subset of the skills in the following list.
List of skills: The student
- understands the needs for (pseudo)randomization in cryptography, and the difference between randomness and pseudorandomness;
- can explain the definition of secure cryptographic scheme under different kinds of attacks, and the definitions of the most important cryptographic primitives;
- can explain the assumptions underlying public-key cryptography;
- can apply the definitions to decide if a simple cryptographic scheme is secure or not;
- can describe basic cryptographic schemes and constructions (i.a. rCTR, NMAC, CBC-MAC, ENC-THEN-MAC, OAEP, FDH, PSS, DH, Elgamal, hybrid encryption);
- can construct provably-secure cryptographic schemes based on these constructions and primitives;
- can explain the advantages and disadvantages of private-key and public-key cryptography;
- can describe and apply the algebraic and number theoretic results underlying RSA- and DLP-based cryptography, spefically properties of finite commutative groups, distribution of primes, and generation of pseudorandom primes;
- can compute in the algebraic structures underlying RSA- and DLP-based cryptographic primitives;
- can explain the basic advantages and disadvantages of elliptic curves in DLP-based cryptography.
The exam may be repeated at the end of the semester.