A character theoretic approach to planar functions

作者:Pott, Alexander*; Zhou, Yue
来源:Cryptography and Communications, 2011, 3(4): 293-300.
DOI:10.1007/s12095-011-0044-4

摘要

A function f : F-p(n) -> F-p(n) is called planar if x bar right arrow f (x + a) - f (x) is a permutation for all a not equal 0. In this note we characterize planar functions within a class of functions F-p(2m) -> F-p(2m) via the planarity of functions F-p(m) -> F-p(m). This class contains some interesting families of planar functions. The proof uses character theoretic arguments.