Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie

Splitting polynomials and the discrete logarithm problem

Vortrag von Prof. Dr. Jens Zumbrägel

Sprecher eingeladen von: Prof. Dr. Joachim Rosenthal

Datum: 14.11.18  Zeit: 16.00 - 17.00  Raum: Y27H12

There has been tremendous progress in computing discrete logarithms in finite fields of small characteristic. At the heart of the new methods are polynomials that split into linear factors, among them polynomials of the form X^{q+1} + a X + b and, more generally, so-called projective polynomials. We survey some recent approaches on how to control certain families of these polynomials in order to obtain heuristic-free quasi-polynomial algorithms for solving the discrete logarithm problem.