ON ISOTOPISMS OF COMMUTATIVE PRESEMIFIELDS AND CCZ-EQUIVALENCE OF FUNCTIONS
Lilya Budaghyan, Tor Helleseth · International Journal of Foundations of Computer Science · 2011
A function F from Fpnto itself is planar if for any [Formula: see text] the function F(x+a)-F(x) is a permutation. CCZ-equivalence is the most general known equivalence relation of functions preserving planar property. This paper considers two possible extensions of CCZ-equivalence for functions over fields of odd characteristics, one proposed by Coulter and Henderson and the other by Budaghyan and Carlet. We show that the second one in fact coincides with CCZ-equivalence, while using the first one we generalize one of the known families of PN functions. In particular, we prove that, for any odd prime p and any positive integers n and m, the indicators of the graphs of functions F and F' from Fpnto Fpmare CCZ-equivalent if and only if F and F′ are CCZ-equivalent. We also prove that, for any odd prime p, CCZ-equivalence of functions from Fpnto Fpm, is strictly more general than EA-equivalence when n ≥ 3 and m is greater or equal to the smallest positive divisor of n different from 1.