# Cryptography

## Prof. Dr. Markus Bläser

### News

You can inspect the grading of the re-exams on **Wednesday, April 26, 2:15pm, in Room 415, E1.3**.

A solution for the final exam is now available here.

### Topic

We will follow the book by Katz & Lindell, Introduction to Modern Cryptography, CRC Press. It is highly recommended that you own this book, since we might occasionally skip proofs and you will be asked to read them on your own. Moreover reading the relevant section before and/or after the lecture deepens your understanding.

- Oct 26: Historical ciphers, principles of modern cryptography (Reading: Chapter 1)
- Oct 28: Finite probability spaces (Notes available)
- Nov 2: Finite probability spaces; perfect secrecy (Reading: Chapters 2.1, 2.2, 2.3)
- Nov 4: Perfect secrecy, computational secrecy (Reading: Chapters 3.1, 3.2, 3.3)
- Nov 9: Computational secrecy
- Nov 11: Computational secrecy (Reading: Chaper 3.4, 3.5, 3.6)
- Nov 18: Computational secrecy
- Nov 23: Message authentication (Reading: Chapter 4.1, 4.2, 4.3)
- Nov 24: Message authentication (Reading: Chapter 3.7, 4.5)
- Nov 30: Message authentication
- Dec 2: Hash functions (Reading: Chapters 5.1, 5.2, 5.3)
- Dec 7: Discussion Assignment 05, Q&A
- Dec 9: Midterm
- Dec 14: Hash functions (Reading: Chapters 5.4, 5.5)
- Dec 16: Theoretical Constructions of Symmetric-Key Primitives (Reading Chapter 7.1 - 7.7)

Chapter 7 is not relevant for any exams. However, I strongly recommend to read at least Chapter 7.1 and 7.2) - Jan 4: Basic number theory, Primality testing (Reading: Chapter 8.2, B.1)
- Jan 6: RSA
- Jan 11: Diffie-Hellman
- Jan 13; Key exchange, public key encryption (Reading: Chapter 10, Chapter 11.1, 11.2)
- Jan 18: Hybrid-Encryption, KEM (Reading: Chapter 11.3)
- Jan 20: Diffie-Hellman based encryption (Reading: Chapter 11.4)
- Jan 25: ctd.
- Jan 27: RSA-based encryption (Reading: Chapter 11.5)
- Feb 1: ctd, Digital signature schemes (Reading: Chapter 12.1 - 12.4)
- Feb 3: Digital signature schemes
- Feb 8: Digital signature schemes (Reading: Chapter 12.5 - 12.6)
- Feb 10: Digital signature schemes
- Feb 15: Digital signature schemes
- Feb 17: Discussion Assignment "Endterm preparation"

### Time & Date

- Wednesday 12:15 to 14:00, GHH
- Friday 12:15 to 14:00, GHH

### Lecturer

**Prof. Dr. Markus Bläser**, Email: mblaeser at cs.uni-saarland...

Office Hours: whenever my office door is open, E 1 3, Room 412

### Assistants

**Cornelius Brand**, Email: cbrand@mmci.uni-saarland.de

Office Hours: by appointment, E1.3, room 426**Marc Roth**, Email: mroth@mmci.uni-saarland.de

Office Hours: by appointment, E1.3, room 426

### Grading

**Information for the endterm:**

- The endterm takes place in GHH on Monday, March 6. We start at 13:30. Please be there in time. The total duration of the exam is 120 min.
- The exam questions will cover chapter 1 to 5, 6.1, 6.2, 8, and 10 to 12 of the book as well as the notes on probability theory.
- You can bring one DinA4 sheet (=two pages) of handwritten notes to the exam. No printouts, no photocopies! And of course, no books, no cell phones, no ....
- You need to register in HISPOS (or something equivalent for those who cannot) to take part in the endterm

Your grade will be the grade of the exam at the end of the semester (either endterm or re-exam). There will be a midterm in December. Participation is voluntary. Points achieved in the midterm are bonus points in the endterm and/or re-exam and hence can help to improve your grade.

- Midterm: Fri, Dec 9, during class
- Endterm: Mon, Mar 6, 13:00 - 16:00, GHH and HS1 in E2.5
- Re-exam: Wed, Apr 5, 13:00 - 16:00, GHH in E2.5

> 56: 1

> 54: 1.3

> 52: 1.7

> 50: 2

> 48: 2.3

> 45: 2.7

> 41: 3

> 38: 3.3

> 34: 3.7

> 28: 4

< 29: 5

### Exam

- Midterm:
**Dec. 9, 2016**, 12-14 at GHH

### Exercise Groups

There will be weekly tutorials starting in the week Nov. 7 to Nov. 11. Registration for the tutorials is possible from Oct. 31 to Nov. 3 on this web page. There will be different time slots available.Assignments will be handed out every Wednesday and are due one week later. We will collect them in the lecture hall before the lecture starts.

To be admitted to the exams, you need at least 50% of the points in the assignments. You can submit the assignments in groups of up to three people. However, everybody should have understood each solution and should be able to present them in the tutorial.

Groupnr | Time | Place | Bremser | |
---|---|---|---|---|

1 | Mo 16-18 | E1.3, SR 014 | Cornelius Brand | cbrand@mmci... |

2 | Tue 14-16 | E1.3 SR 107 | Istvan Seres | seresistvanandras@gmail... |

3 | Thu 10-12 | E1.3 SR 014 | Istvan Seres | seresistvanandras@gmail... |

4 | Thu 14-16 | E1.3 SR107 | Thomas Haslbauer | s9thhasl@stud... |

### Assignments

- Assignment 01
- Assignment 01 Sample Solution
- Assignment 02
- Assignment 02 Sample Solution
- Assignment 03
- Assignment 03 Sample Solution
- Assignment 04
- Assignment 04 Sample Solution
- Assignment 05
- Assignment 05 Sample Solution
- Assignment 06
- Assignment 06 Sample Solution
- Assignment 07 Sample Solution (Presence Exercises)
- Assignment 08
- Assignment 08 Sample Solution
- Assignment 09
- Assignment 09 Sample Solution
- Assignment 10
- Assignment 10 Sample Solution
- Assignment 11
- Assignment 11 Sample Solution
- Assignment 12
- Assignment 12 Sample Solution
- Endterm Exam Sample Solution
- Endterm preparation
- Midterm Exam Sample Solution
- Sample Exam Sample Solution

### Script

### Slides

- Chapter 1 (Oct 26)
- Chapter 2 (Nov 2)
- Chapter 3 (Nov 25)
- Chapter 4 (Nov 30)
- Chapter 6 (Dec 2)
- Chapter 5 (Dec 16)
- Chapter 7 (Dec 16)
- Chapter 8 (Jan 13)
- Chapter 10 (Jan 13)
- Chapter 11 (Jan 20)
- Chapter 11, part 2 (Feb 1)
- Chapter 12 (Feb 10)

### Others

### Literature

We will mainly follow the book by Katz & Lindell. The book by Stirzaker is a very good introduction to elementary probability theory.

- Jonathan Katz, Yeduda Lindell,
**Introduction to Modern Cryptography, 2nd ed.**, CRC Press. - David Stirzaker,
**Elementary Probability, 2nd ed.**, Cambridge University Press.