Affiliation:
1. Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway
Abstract
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Equivalence for generalized Boolean functions;Advances in Mathematics of Communications;2023
2. CCZ equivalence of power functions;Designs, Codes and Cryptography;2017-03-07
3. Explicit Criteria for Construction of Plateaued Functions;IEEE Transactions on Information Theory;2016-12
4. Constructing commutative semifields of square order;Advances in Mathematics of Communications;2016-04
5. Explicit criterions for p-ary functions being non-bent;Journal of Mathematical Analysis and Applications;2016-01