Seminar Advanced Topics in Crytography

This course is listed in Aachen Campus as Seminar Advanced Topics in Cryptography and in Bonn Basis as Seminar Advanced Topics in Cryptography.

Responsible

Prof. Dr. Joachim von zur Gathen

Lecture

Michael Nüsken

Time & Place

Wednesday, 16³⁰-18³⁰, b-it 1.25.

First meeting: Thursday, 11 April 2013, 10⁰⁰.

Prerequisites

Basic knowledge of cryptography and fast understanding of mathematical and computer science topics is required.

The topic is not yet determined. Previous instantiations dealt with fuzzy coding theory, Zero-Knowledge, PCP, ellitpic curve theory, analytical number theory, ... In any case the topic will try to dig deeper than what you expect in a standard course or seminar.

Options

Research reviews from latest conferences, eg. CRYPTO, EUROCRYPT, ...
Security of symmetric crypto.
Security of SHA3/Keccak and friends.

The chosen topic is

Cryptographic research on eprint:
Recent developments for discrete logarithms in finite fields

Schedule

24.04.2013, 08.05.2013, 15.05.2013 16³⁰, Bastian Hafer: Index calculus algorithms with α=½ and 1/3≤α<1.
05., 12., 19., 26.06.2013 16³⁰, Doga Can Sertbas: Function field sieve and discrete logarithms in GF(2⁸⁰⁹).
03., 10., 17.07.2013 16³⁰, Bahadir Gizlici: Index calculus with α=1/4.
17.07.2013 17⁰⁰, Daniel Loebenberger: A quasi-polynomial algorithm for small characteristics.

Literature

Razvan Barbulescu (2013). Selecting polynomials for the Function Field Sieve. eprint 2013/200.
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau and Paul Zimmermann (2013). Discrete logarithm in GF(2⁸⁰⁹) with FFS. eprint 2013/097.
Jérémie Detrey and Pierrick Gaudry and Marion Videau (2013). Relation collection for the Function Field Sieve. eprint 2013/071.
Jean-Charles Faugère and Pierrick Gaudry and Louise Huot and Guénaël Renault (2012). Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. eprint 2012/199.
Faruk Gologlu and Robert Granger and Gary McGuire and Jens Zumbragel (2013). On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in GF(2¹⁹⁷¹). eprint 2013/074.
Antoine Joux (2012). Faster index calculus for the medium prime case. Application to 1175-bit and 1425-bit finite fields. eprint 2012/720.
Antoine Joux (2013). A new index calculus algorithm with complexity L(1/4+o(1)) in very small characteristic. eprint 2013/095.
Antoine Joux (2013). Discrete Logarithms in GF(2⁴⁰⁸⁰).
Antoine Joux & Reynald Lercier (2006). The Function Field Sieve in the Medium Prime Case. EUROCRYPT 2006. @iacr.
Wikipedia (2013). Discrete logarithm records.
...
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé (2013). A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Preprint@INRIA.

Allocation

2 SWS, 4 ECTS credits.

Media Informatics, Communication Skills.
University of Bonn - Computer Science, A or A1.
University of Bonn - Mathematics.
Universtiy of Bonn - Master Computer Science, Module MA-INF 1209.