Permuting F_q using a density method

The construction of permutation functions of a finite field is a task of great interest in cryptography and coding theory. In this talk we describe a method which combines Chebotarev density theorem with elementary group theory to produce permutation rational functions over a finite field F_q. Our method is entirely constructive and as a corollary we get the classification of permutation polynomials up to degree 4 over any finite field of odd characteristic.

This is a joint work with Andrea Ferraguti.