Zur Hauptnavigation / To main navigation

Zur Sekundärnavigation / To secondary navigation

Zum Inhalt dieser Seite / To the content of this page

Hauptnavigation / Main Navigation

Sekundärnavigation / Secondary navigation

Cryptography

Inhaltsbereich / Content

Cryptography

Assistant

Tommy Hofmann

Timetable

Lecture
Monday 10.00 - 11.30 48-210
Thursday 10.00 - 11.30 48-208
Tutorials
Tuesday 15.30 - 17.00 48-438
Thursday 11.45 - 13.15 11-260

At most three names are allowed to appear on the homework you hand in. Regularly, active and successful participation in the exercise classes is required to achieve an "Übungsschein" (3 CP). This includes scoring at least 1 point at at least 70% of the problems.

If you wish to attend the tutorial, please enroll via URM by April 19, 2013.

Problem sets

Problem set 1 Friday, April 19th, 1pm PDF
Problem set 2 Friday, April 26th, 1pm PDF
Problem set 3 Friday, May 3rd, 1pm PDF
Problem set 4 Friday, May 10th, 1pm PDF
Problem set 5 Friday, May 17th, 1pm PDF
Problem set 6 Friday, May 24th, 1pm PDF
Problem set 7 Friday, May 31st, 1pm PDF
Problem set 8 Friday, June 7th, 1pm PDF
Problem set 9 Friday, June 14th, 1pm PDF
Problem set 10 Friday, June 21st, 1pm PDF
Problem set 11 Friday, June 28th, 1pm PDF
Problem set 12 Friday, July 5th, 1pm PDF
Problem set 13 Friday, July 12th, 1pm PDF

Literature

The course is roughly based on the book by David Kohel and the script by Mohammed Barakat. Additional literature:

  • Johannes Buchmann, Einführung in die Kryptographie, Springer, 5. Aufl., 2010
  • Neal Koblitz, A Course in Number theory and Cryptography, Springer, 2nd ed., 1994
  • Neal Koblitz, Algebraic Aspects of Cryptography, Springer, 1998

There is a wealth of other crypto-literature available on the net, but the two online references and the book of Buchmann are my main sources.

Especially for experimentation, frequency analysis and similar there are several free tools available, eg. , but most of the experiments could be done in any programming language or computer algebra system.

Note, while there will not be any mandatory computer work i this class, there are many places where computer supported experimentation would be useful.