Image sets of perfectly nonlinear maps
share
We present a lower bound on the image size of a d-uniform map, d≥ 1, of finite fields, by extending the methods used for planar maps. In the particularly interesting case of APN maps on binary fields, our bound coincides with the one obtained by Ingo Czerwinski, using a linear programming method. We study properties of APN maps of 𝔽_2^n with minimal image set. In particular, we observe that for even n, a Dembowski-Ostrom polynomial of form f(x) =f'(x^3) is APN if and only if f is almost-3-to-1, that is when its image set is minimal. We show that any almost-3-to-1 quadratic map is APN, if n is even. For n odd, we present APN Dembowski-Ostrom polynomials on 𝔽_2^n with image sizes 2^n-1 and 5· 2^n-3. We present several results connecting the image sets of special APN maps with their Walsh spectrum. Especially, we show that a large class of APN maps has the classical Walsh spectrum. Finally, we prove that the image size of a non-bijective almost bent map contains at most 2^n-2^(n-1)/2 elements.
READ FULL TEXT
