Applied Algebra Group at the University of Zürich 

Module: MAT076 Arbeitsgemeinschaft in Codierungstheorie und Kryptographie Event: n.n. Arbeitsgemeinschaft in Codierungstheorie und Kryptographie Splitting polynomials and the discrete logarithm problem
Prof. Dr. Jens Zumbrägel's talk Date: 14.11.18 Time: 16.00  17.00 Room: 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, socalled projective polynomials. We survey some recent approaches on how to control certain families of these polynomials in order to obtain heuristicfree quasipolynomial algorithms for solving the discrete logarithm problem. 