Links und Funktionen
Sprachumschaltung

Navigationspfad
You are here: Home / Teaching / Summer 2017 / Cryptography


Inhaltsbereich

Cryptography

Lecture, 3 hours per week, Mo noon-2pm, Th 2pm-4pm, Hofmann; Tutorial, 2 hours per week, Tu 2pm-4pm, Schöpp

News

  • Exercise sheet 1 is now available below.
  • Please note that the rooms for lectures have changed!
  • Please register for this course at UniWorX.

Content

The course provides an introduction to modern cryptography and covers both theoretical concepts and practical aspects. In particular, on the theory side we will get to know the basics of semantic security and rigorous proofs of security by reduction. On the practical side we will learn about popular cryptographic schemes like AES, RSA, and ECC as well as hash functions and digital signatures. If time permits we will also take a glimpse at cryptanalysis and at cryptographic protocols and their security.

The course is based on the book "Introduction to Modern Cryptography" by Jonathan Katz and Yehuda Lindell, Chapman & Hall, 2008.

The lectures will be presented on the whiteboard and there will therefore be no transparencies available for download. We will, however, indicate the sections of the textbook covered in each lecture and provide ASCII summaries of the material.


Organization


Place and Time

SessionTimeBegin
Lecture Monday, noon-2pm Geschw.-Scholl-Pl. 1, M 114 24.04.2017
Lecture Thursday, 2pm-4pm Schellingstr. 3, S 002
Tutorial Tuesday, 2pm-4pm Theresienstr. 41, C 111  02.05.2017

To reach the planned 3 hours per week, lectures will only be held on the dates shown in the table below. Tutorials are held every week.
Table is still provisional. Please check again later!

Nr Date Topic Sections in textbook Notes Lecturer
L1 24.04.17 Organisation, overview, historic ciphers:  shift cipher, frequency analysis 1.1-1.4 Ch.1 MH
L2 27.04.17 Vigenere cipher, one-time pad, Shannon's theorem  2 Ch. 2 MH
01.05.17 (Public holiday)
L3 04.05.17 Forms of attack, kpa, cpa etc. Semantic security 3.1, 3.2 MH
08.05.17 x
11.05.17 x
L4 15.05.17 Pseudorandom generators 3.3 MH
L5 18.05.17 Security against chosen plaintext attacks, pseudorandom functions 3.4 MH
L6 22.05.17 Block ciphers, modes of operation 3.6 MH
25.05.17 (Public holiday)
L7 29.05.17 Practical block ciphers. Principles: s/p- and Feistel networks 5.1, 5.2 MH
L8 01.06.17 DES, AES 5.3-5.5 MH
05.06.17 (Public holiday)
L9 08.06.17 Cryptanalysis 5.6, LSFR insecure (Buchmann) MH
L10 12.06.17 Message integrity, hashing 4.1-4.5 MH
15.06.17 (Public holiday)
L11 19.06.17 Merkle-Damgard construction, SHA 4.6 MH
L12 22.06.17 Number theory and hardness assumptions 7.1-7.3
L13 26.06.17 Diffie-Hellman key exchange, RSA 9, 10.5 MH
L14 29.06.17 El Gamal, Elliptic curve cryptography 10.5 MH
L15 03.07.17 Factoring and computing discrete logarithms 8 MH
L16 06.07.17 Semantic security of public key cryptography with random oracles 13
10.07.17 x x
13.07.17 x x
17.07.17 x x
L17 20.07.17 Protocol security (Needham Schroeder) US
L18 24.07.17 Authentication, digital signatures (Schnorr, Guillou-Quisquater) 12 MH
L19 27.07.17 A glimpse at quantum and post quantum crypto (not relevant for exam) MH

Legend: L means lecture.


Tutorials

  • Sheet 1, file vigenere.txt for Exercise 1-2; solutions will be discussed in the Tutorial on 2 May.

Material


Exam

The course will be graded by a written exam.

There will be a make-up exam at the beginning of the winter term. Details to follow here. Participants that did not partake in the first exam are also allowed to register for the make-up exam, provided that they acknowledge that there will not be third exam offered. 

Document Actions


Funktionsleiste