Cryptography

Corresponding entry in Aachen Campus, Bonn Basis (Lecture, Tutorial).

Lecture

Priv.-Doz. Dr. Adrian Spalka.

Tutorial

Konstantin Ziegler.

Time & Place

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

First meeting: Thursday, 28 October 2010, 12¹⁵, b-it bitmax.

No tutorial on Monday, 1 November 2010.

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 to the mailing list using the information given on the list's Info page.

Slides

The slides (PDF) presented in the lecture are provided here regularly (last updated 10 February 2011, 18:51).

Exercises

Exercise 1 (PDF, last updated 28 October 2010, 17:37).
Exercise 10 (PDF, last updated 24 January 2011, 17:26).
Exercise 11 (PDF, last updated 31 January 2011, 17:17).
Exercise 2 (PDF, last updated 06 November 2010, 18:13).
Exercise 3 (PDF, last updated 19 November 2010, 14:58).
Exercise 4 (PDF, last updated 19 November 2010, 14:58).
Exercise 5 (PDF, last updated 29 November 2010, 14:57).
Exercise 6 (PDF, last updated 08 December 2010, 00:48).
Exercise 7 (PDF, last updated 22 December 2010, 13:38).
Exercise 8 (PDF, last updated 20 December 2010, 11:55).
Exercise 9 (PDF, last updated 18 January 2011, 16:46).

Submission guidelines

Students may submit the assignments in groups of arbitrary size in physical or electronic form. In the former case, put it in the box at the infodesk. In the latter case, send it as a single pdf-attachment to the tutor.

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.

Presentation

Topics

elliptic curve factorization (taken)
advanced probabilistic primality testing
failed attempts to turn NP-complete problems into "yet another public-key crypto systems"
side channel attacks (taken)
security based only on symmetric cryptography (taken)
IVs for Modes of Operation (taken)
biometric security (taken)
the hash crisis (taken)
applications of steganography (taken)

Timeline

unitl 16 Dec 2010: register with a chosen topic as a team of two
until 27 Jan 2011: Individually submit a written report of 3 pages using Springer's LNCS style. The LNCS Author Instructions there provide valuable hints.
10 Feb 2011 @ b-it 2.1: give a talk of 15 minutes length; after each topic, there is a short discussion
- 09.00-09.30 Cakir and Panareda, steganography
- 09.45-10.15 Eppelsheimer and Weidenbach, side channel attacks
- 10.30-11.00 Franzen and Percinel, elliptic curve factorization
- 11.15-11.45 Hoese and Viehoefer, IVs for modes of operation
- 13.00-13.30 Jenniches and Landsberg, symmetric cryptography
- 13.45-14.15 Koch and Schaefer, hash crisis
- 14.30-15.00 Polat and Schmitt, biometric security

Literature

Richard Crandall & Carl Pomerance, Prime Numbers: A Computational Perspective, Springer-Verlag, 2001, ISBN 0-387-94777-9.
Ross Anderson, Security Engineering, 2nd edition, Wiley. The book has a website where the complete 1st edition is available for download.

Final Exam

Time and place: 17 February 2011, 9.00 am in b-it bitmax

Admittance to the exam requires 50% of all points on the assignments and presence in all tutorials.

2nd exam: 29 March 2011, 9.00 am in b-it Rheinsaal.