Bonn-Aachen International Center
for Information Technology





city life
cosec >students >Teaching >Winter 2016/2017 
Register?New password?


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


Michael Nüsken


Michael Nüsken

Time & Place

First meeting: Monday, 31 October 2016.


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 cheat sheet, DIN A4, two-sided, written only with your own handwriting. 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.

Pre-exam meeting: Monday, 20 February 2017, 1300, b-it bitmax.

Exam: Thursday, 23 February 2017, 1000, b-it bitmax.

Post-exam meeting: tba.

Exam2 (repetitions only): Thursday, 6 April 2017, 1000, b-it Rheinsaal.


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 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. We will consider these primitives in the modern light of reducible security (or provable security).


The screen notes (PDF) contain all presented stuff (last updated 13 February 2017, 18:23).



Further topics:




4+2 SWS.

The lecture's mailing list

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

[Sorry, you need to enable Javascript to see this.]

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

Imprint, webmaster & more