Highly nonlinear functions are important as sources of low-correlation sequences, high-distance codes and cryptographic primitives, as well as for applications in combinatorics and finite geometry. We argue that the theory of such functions is best seen in terms of splitting factor pairs. This introduces an extra degree of freedom, through the pairing of a normalised function φ : G → N between groups with a homomorphism ρ : G → Aut(N). From this perspective we introduce a new definition of equivalence for functions, relative to ρ, and show it preserves their difference distributions. When ρ ≡ 1 it includes CCZ and generalised linear equivalence, as well as planar and linear equivalence. More generally, we use splitting factor pairs to relate several important measures of nonlinearity. We propose approaches to both linear approximation theory and bent functions, and to difference distribution theory and perfect nonlinear functions, which encompass the current approaches. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Horadam, K. J. (2006). A theory of highly nonlinear functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 87–100). https://doi.org/10.1007/11617983_8
Mendeley helps you to discover research relevant for your work.