摘要

In this paper, we generalize the switching method and present a method to construct new differentially 4-uniform permutations from two known ones by determining the corresponding cycle sets. As for applications, by determining all the cycle sets of related to the inverse functions, respectively, we present two efficient constructions of differentially 4-uniform permutations. Moreover, it has been checked by the Magma software for small n that, both constructions give many new Carlet-Charpin-Zinoviev (CCZ)-inequivalent classes of functions that are not CCZ-equivalent to the known functions.