Constructing rotatable permutations of ${\mathbb{F}}_{2^m}^3$ with $3$-homogeneous functions

In the literature, there are many results about permutation polynomials over finite fields. However, very few permutations of vector spaces are constructed although it has been shown that permutations of vector spaces have many applications in cryptography, especially in constructing permutations with low differential and boomerang uniformities. In this paper, motivated by the butterfly structure \cite{perrin2016cryptanalysis} and the work of Qu and Li \cite{qu2023}, we investigate rotatable permutations from ${\text{gf}}_{2^m}^3$ to itself with $d$-homogenous functions. Based on the theory of equations of low degree, the resultant of polynomials, and some skills of exponential sums, we construct five infinite classes of $3$-homogeneous rotatable permutations from ${\text{gf}}_{2^m}^3$ to itself, where $m$ is odd. Moreover, we demonstrate that the corresponding permutation polynomials of ${\text{gf}}_{2^{3m}}$ of our newly constructed permutations of ${\text{gf}}_{2^m}^3$ are QM-inequivalent to the known ones.