Cryptography

This course is listed in Aachen Campus as Cryptography, in Bonn Basis as MA-INF1103_Cryptography.

Lecture

Prof. Dr. Joachim von zur Gathen

Tutorial

Dr. Daniel Loebenberger

Time & Place

Monday, 13⁰⁰-14³⁰, b-it bitmax.
Thursday, 13⁰⁰-14³⁰, b-it bitmax.
Tutorial: Monday, 14⁴⁵-16¹⁵, b-it bitmax.

First meeting: 28 October 2013.

Final Exam

1st exam: 12 March 2014, 13⁰⁰ - 15⁰⁰, b-it bitmax.

2nd exam: 11 April 2014, 13⁰⁰ - 15⁰⁰, b-it bitmax.

Exam hints

Verify whether your exam exercise sheets are complete: It should contain Exercise 1 to Exercise ??. Insert your name and matrikel (student number) on each sheet. Approaches, solutions and all side calculations must be written to the given paper. Please use also the back sides. If you need extra paper ask the supervisor. Do not remove the staple!

Do write with blue or black ink!
Do not use a pencil or any other erasable pen.
The exam must be handled independently. Permitted auxiliary means are: writing materials, a pocket calculator (non-programmable, without division with remainder, without linear algebra software), and a sheet with your own notes (a two-sided DIN A4 sheet with only your own handwriting, no photocopy). Any other utilities, even own paper, are not permitted.

An attempt at deception leads to failure for this exam and possibly other measures - even if the attempt is only detected later.

The exam will carry the hints displayed on the right.

Important advice

Master students in Computer Science at University of Bonn have to register this course with POS (aka BASIS).

Allocation

4+2 SWS, 8 ECTS credits. Optionally, 3+2 SWS, 6 ECTS credits.

Media Informatics: Computer and Communication Technology.
Recommendation for University of Bonn - Computer Science: A or A1, respectively.

Cryptography deals with methods for secure data transfer. In earlier times this was the domain of military and intelligence agencies, but today modern cryptography has grown into a key technology, enabling e-commerce and secure internet communications. Its many applications range from credit and debit cards, mobile phones, tv decoders, and electronic money to unforgeable electronic signatures under orders and contracts in the internet. In the course, we first discuss two of the current standard tools, namely AES and RSA. Further topics are key exchange, including group cryptography and discrete logarithm, digital signatures and identification, and cryptographic hash functions.

Prerequisites

None.

The lecture's mailing list

Students are encouraged to ask and answer any questions related to the course on the mailinglist:

You can subscribe to and unsubscribe from the mailing list using the information given on the list's Info page.

Exercises

Sheet 1 (PDF, last updated 08 November 2013, 10:21).
Sheet 2 (PDF, last updated 08 November 2013, 10:21).
Sheet 3 (PDF, last updated 11 November 2013, 13:09).
Sheet 4 (PDF, last updated 18 November 2013, 17:32).
Sheet 5 (PDF, last updated 28 November 2013, 09:37).
Sheet 6 (PDF, last updated 02 December 2013, 13:18).
Sheet 7 (PDF, last updated 16 December 2013, 12:29).
Sheet 8 (PDF, last updated 17 December 2013, 15:47).
Sheet 9 (PDF, last updated 06 January 2014, 18:33).
Sheet 10 (PDF, last updated 13 January 2014, 14:28).
Sheet 11 (PDF, last updated 20 January 2014, 15:52).
Sheet 12 (PDF, last updated 27 January 2014, 16:38).

Additional files

The 1024bit prime for sheet 8 (txt).
Two encrypted pictures for sheet 11 (png, png).