5,689 research outputs found
A Generalization of APN Functions for Odd Characteristic
Almost perfect nonlinear (APN) functions on finite fields of characteristic
two have been studied by many researchers. Such functions have useful
properties and applications in cryptography, finite geometries and so on.
However APN functions on finite fields of odd characteristic do not satisfy
desired properties. In this paper, we modify the definition of APN function in
the case of odd characteristic, and study its properties
Codes, graphs and schemes from nonlinear functions
AbstractWe consider functions on binary vector spaces which are far from linear functions in different senses. We compare three existing notions: almost perfect nonlinear functions, almost bent (AB) functions, and crooked (CR) functions. Such functions are of importance in cryptography because of their resistance to linear and differential attacks on certain cryptosystems. We give a new combinatorial characterization of AB functions in terms of the number of solutions to a certain system of equations, and a characterization of CR functions in terms of the Fourier transform. We also show how these functions can be used to construct several combinatorial structures; such as semi-biplanes, difference sets, distance regular graphs, symmetric association schemes, and uniformly packed (BCH and Preparata) codes
Constructing APN functions through isotopic shifts
Almost perfect nonlinear (APN) functions over fields of characteristic 2 play an important role in cryptography, coding theory and, more generally, mathematics and information theory. In this paper we deduce a new method for constructing APN functions by studying the isotopic equivalence, concept defined for quadratic planar functions in fields of odd characteristic. In particular, we construct a family of quadratic APN functions which provides a new example of an APN mapping over F 29 and includes an example of another APN function x 9 + Tr(x 3 ) over F 28 , known since 2006 and not classified up to now. We conjecture that the conditions for this family are satisfied by infinitely many APN functions.acceptedVersio
On Equivalence of Known Families of APN Functions in Small Dimensions
In this extended abstract, we computationally check and list the
CCZ-inequivalent APN functions from infinite families on for n
from 6 to 11. These functions are selected with simplest coefficients from
CCZ-inequivalent classes. This work can simplify checking CCZ-equivalence
between any APN function and infinite APN families.Comment: This paper is already in "PROCEEDING OF THE 20TH CONFERENCE OF FRUCT
ASSOCIATION
On Some Properties of Quadratic APN Functions of a Special Form
In a recent paper, it is shown that functions of the form
, where and are linear, are a good source for
construction of new infinite families of APN functions. In the present work we
study necessary and sufficient conditions for such functions to be APN
Non-Boolean almost perfect nonlinear functions on non-Abelian groups
The purpose of this paper is to present the extended definitions and
characterizations of the classical notions of APN and maximum nonlinear Boolean
functions to deal with the case of mappings from a finite group K to another
one N with the possibility that one or both groups are non-Abelian.Comment: 17 page
Differentially 4-uniform functions
We give a geometric characterization of vectorial boolean functions with
differential uniformity less or equal to 4
- …