Constructing permutations of finite fields via linear translators

Methods for constructing large families of permutation polynomials of finite fields are introduced. For some of these permutations the cycle structure and the inverse mapping are determined. The results are applied to lift minimal blocking sets of PG(2,q) to those of PG(2,qn).