# APN Permutations

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

# Characterization of Permutations

## Component Functions

An (𝑛,𝑛)-function 𝐹 is a permutation if and only if all of its components 𝐹λ for λ ∈ 𝔽*2𝑛 are balanced.

## Autocorrelation Functions of the Directional Derivatives

The characterization in terms of the component functions given above can be equivalently expressed as

${\displaystyle \sum _{a\in \mathbb {F} _{2^{n}}^{*}}{\mathcal {F}}(D_{a}f_{\lambda })=-2^{n}}$

for any λ ∈ 𝔽*2𝑛.

Equivalently [1], 𝐹 is a permutation if and only if

${\displaystyle \sum _{\lambda \in \mathbb {F} _{2^{n}}^{*}}{\mathcal {F}}(D_{a}f_{\lambda })=-2^{n}}$

for any λ ∈ 𝔽*2𝑛.

# Characterization of APN Permutations

## On the component functions

Clearly we have that no component function can be of degree 1. (This result is true for general APN maps)

For 𝑛 even we have also that no component can be partially-bent[2]. This implies that, in even dimension, no component can be of degree 2.

## Autocorrelation Functions of the Directional Derivatives

An (𝑛,𝑛)-function 𝐹 is an APN permutation if and only if [1]

${\displaystyle \sum _{\lambda \in \mathbb {F} _{2^{n}}^{*}}{\mathcal {F}}(D_{a}f_{\lambda })=-2^{n}}$

and

${\displaystyle \sum _{\lambda \in \mathbb {F} _{2^{n}}^{*}}{\mathcal {F}}^{2}(D_{a}f_{\lambda })=2^{2n}}$

for any 𝑎 ∈ 𝔽*2𝑛.

1. Thierry Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy, On Almost Perfect Nonlinear Functions Over GF(2^n), IEEE Transactions on Information Theory, 2006 Sep,52(9),4160-70
2. Marco Calderini, Massimiliano Sala, Irene Villa, A note on APN permutations in even dimension, Finite Fields and Their Applications, vol. 46, 1-16, 2017