We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree k over Fq is induced by an action from a permutation polynomial of F q k with coefficients in Fq. The dynamics of these permutations of irreducible polynomials of degree k over Fq, such as fixed points and cycle lengths, are studied. As an application, we also generate irreducible polynomials of the same degree by an iterative method. * q , the multiplicative order of α is defined by ord(α) := min{d > 0 | α d = 1}. The degree deg(α) of α ∈ F q over F q is defined as the degree of the minimial polynomial of α over F q . If a, n are positive integers such that gcd(a, n) = 1, then ord n a := min{r > 0 | a r ≡ 1 (mod n)}. In the following theorem, we present some well-known results on the multiplicative order of elements in finite fields.