Number theory tools for Cryptographic Applications

17 May 2016
10:00
Giacomo Micheli
Abstract

In this lecture we describe the effective Chebotarev Theorem for global function fields and show how this can be used to describe the statistics of a polynomial map f in terms of its monodromy groups. With this tool in hand, we will provide a strategy to remove the remaining heuristic in the quasi-polynomial time algorithm for discrete
logarithm problems over finite fields of small characteristic.