The art of cryptography: algorithmic cryptanalysis

Corresponding entry in Aachen Campus, Bonn Basis.

Responsible

Prof. Dr. Joachim von zur Gathen

Lecture

Daniel Loebenberger and Konstantin Ziegler

Tutorial

Daniel Loebenberger and Konstantin Ziegler

Time & Place

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

First meeting: Thursday, 07 April 2011 at 13⁰⁰, b-it bitmax.
First tutorial: Monday, 18 April 2011 at 14⁴⁵, b-it bitmax.

Exam

Exam: 20 July 2011, 10⁰⁰-12⁰⁰, b-it bitmax.

2nd exam: 01 September 2011, 09⁰⁰-11⁰⁰, b-it 1.25.

Allocation

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

Successful completion of the course yields 8 credit points. For students who only want 6 credit points, a breakpoint at about 3/4 of the teaching time will be defined, and only the course material up to that point will be relevant for their exams and grades.

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

The analysis of cryptographic algorithms requires algorithmic techniques from many areas:
While for symmetric algorithms probabilistic methods like linear and differential cryptanalysis are employed, one uses properties of certain algebraic structures like number fields, lattices or elliptic curves for the analysis of asymmetric algorithms.

In the lecture we will focus on both: symmetric and asymmetric cryptanalysis. After describing the basic tools that we are going to work with, we will delve into the various methods of breaking cryptographic algorithms.

Exercises

Exercise 0 (PDF, last updated 07 April 2011, 14:45).
Exercise 1 (PDF, last updated 14 April 2011, 17:32).
Exercise 2 (PDF, last updated 19 April 2011, 11:56).
Exercise 3 (PDF, last updated 30 April 2011, 01:44).
Exercise 4 (PDF, last updated 07 May 2011, 12:37).
Exercise 5 (PDF, last updated 13 May 2011, 09:34).
Exercise 6 (PDF, last updated 18 May 2011, 22:42).
Exercise 7 (PDF, last updated 27 May 2011, 15:14).
Exercise 8 (PDF, last updated 03 June 2011, 15:35).
Exercise 9 (PDF, last updated 15 June 2011, 15:42).
Exercise 10 (PDF, last updated 24 June 2011, 00:44).
Exercise 11 (PDF, last updated 28 June 2011, 17:31).
Exercise 12 (PDF, last updated 05 July 2011, 15:00).

Additional files

Exercise 4: output stream (txt).
NTL example (cpp).

Prerequisites

Basic knowledge in cryptography is needed, as for example the course Cryptography held in the previous winter. Compare our programme.

Literature

Richard Crandall & Carl Pomerance, Prime Numbers: A Computational Perspective, Springer-Verlag, 2001, ISBN 0-387-94777-9.
Antoine Joux, Algorithmic Cryptanalysis, CRC Press, 2009.
Jonathan Katz & Yehuda Lindell, Introduction to Modern Cryptography, CRC Press, 2008.

Mailinglist

We will put each member on the mailing list . You can also subscribe yourself. The list is intented for all participants of the course as a platform for discussions around the topic. Furthermore, announcements regarding the course are made here.