Almost Perfect Nonlinear (APN) Functions: Difference between revisions

From Boolean
No edit summary
No edit summary
Line 53: Line 53:


Similar techniques can be used to characterize permutations and APN functions with plateaued components.
Similar techniques can be used to characterize permutations and APN functions with plateaued components.
= Characterization of Plateaued Functions =
== Characterization by the Derivatives <ref name="carletPlateaued">Carlet C. Boolean and vectorial plateaued functions and APN functions. IEEE Transactions on Information Theory. 2015 Nov;61(11):6272-89.</ref> ==
=== First characterization ===
Using the fact that two integer-valued functions over <math>\mathbb{F}_2^m</math> are equal precisely when their Fourier transforms are equal, one can obtain the following characterization.
Let <math>F</math> be an <math>(n,m)</math>-function. Then:
- <math>F</math> is plateaued if and only if, for every <math>v \in \mathbb{F}_2^m</math>, the size of the set
<div><math> \{ (a,b) \in (\mathbb{F}_2^n)^2 : D_aD_bF(x) = v \}</math></div>
does not depend on <math>x</math>;
- <math>F</math> is plateaued with single amplitude if and only if the size of the above set depends neither on <math>x</math> nor on <math>v</math> when <math>v \ne 0</math>.
Moreover:
- for any <math>(n,m)</math>-function <math>F</math>, the value distribution of <math>D_aD_bF(x)</math> equals the value distribution of <math>D_aF(b) + D_aF(x)</math> as <math>(a,b)</math> ranges over <math>(\mathbb{F}_2^n)^2</math>;
- if two plateuaed functions have the same distribution, then for every <math>u</math>, their component functions at <math>u</math> have the same amplitude.
=== Characterization in the Case of Unbalanced Components ===
Let <math>F</math> be an <math>(n,m)</math>-function. Then <math>F</math> is plateuaed with all components unbalanced if and only if, for every <math>v,x \in \mathbb{F}_2^n</math>, we have
<div><math> | \{ (a,b) \in (\mathbb{F}_2^n)^2 : D_aD_bF(x) = v \} | = | \{ (a,b) \in (\mathbb{F}_2^n)^2 : F(a) + F(b) = v \} |.</math></div>
Moreover, <math>F</math> is plateuaed with single amplitude if and only if, in addition, this value does not depend on <math>v</math> for <math>v \ne 0</math>.

Revision as of 13:21, 7 February 2019

Background and definition

Almost perfect nonlinear (APN) functions are the class of (n,n) Vectorial Boolean Functions that provide optimum resistance to against differential attack. Intuitively, the differential attack against a given cipher incorporating a vectorial Boolean function F is efficient when fixing some difference δ and computing the output of F for all pairs of inputs (x1,x2) whose difference is δ produces output pairs with a difference distribution that is far away from uniform.

The formal definition of an APN function F:𝔽2n→𝔽2n is usually given through the values

ΔF(a,b)=|{x∈𝔽2n:F(x)+F(a+x)=b}|

which, for a≠0, express the number of input pairs with difference a that map to a given b. The existence of a pair (a,b)∈𝔽2n∗×𝔽2n with a high value of ΔF(a,b) makes the function F vulnerable to differential cryptanalysis. This motivates the definition of differential uniformity as

ΔF=max⁡{ΔF(a,b):a∈𝔽2n∗,b∈𝔽2n}

which clearly satisfies ΔF≥2 for any function F. The functions meeting this lower bound are called almost perfect nonlinear (APN).

Characterizations

Walsh transform[1]

Any (n,m)-function F satisfies

∑a∈𝔽2n,b∈𝔽2m∗WF4(a,b)≥22n(3⋅2n+m−2m+1−22n)

with equality characterizing APN functions.

In particular, for (n,n)-functions we have

∑a∈𝔽2n,b∈𝔽2n∗WF4(a,b)≥23n+1(2n−1)

with equality characterizing APN functions.

Sometimes, it is more convenient to sum through all b∈𝔽2m instead of just the nonzero ones. In this case, the inequality for (n,m)-functions becomes

∑a∈𝔽2n,b∈𝔽2mWF4(a,b)≥22n+m(3⋅2n−2)

and the particular case for (n,n)-functions becomes

∑a,b∈𝔽2nWF4(a,b)≥23n+1(3⋅2n−1−1)

with equality characterizing APN functions in both cases.

Autocorrelation functions of the directional derivatives [2]

Given a Boolean function f:𝔽2n→𝔽2, the autocorrelation function of f is defined as

ℱ(f)=∑x∈𝔽2n(−1)f(x)=2n−2wt(f).

Any (n,n)-function F satisfies

∑λ∈𝔽2nℱ(Dafλ)=22n+1

for any a∈𝔽2n∗. Equality occurs if and only if F is APN.

This allows APN functions to be characterized in terms of the sum-of-square-indicator ν(f) defined as

ν(f)=∑a∈𝔽2nℱ2(DaF)=2−n∑a∈𝔽2nℱ4(f+φa)

for φa(x)=Tr(ax).

Then any (n,n) function F satisfies

∑λ∈𝔽2n∗ν(fλ)≥(2n−1)22n+1

and equality occurs if and only if F is APN.

Similar techniques can be used to characterize permutations and APN functions with plateaued components.

Characterization of Plateaued Functions

Characterization by the Derivatives [3]

First characterization

Using the fact that two integer-valued functions over 𝔽2m are equal precisely when their Fourier transforms are equal, one can obtain the following characterization.

Let F be an (n,m)-function. Then:

- F is plateaued if and only if, for every v∈𝔽2m, the size of the set

{(a,b)∈(𝔽2n)2:DaDbF(x)=v}

does not depend on x;

- F is plateaued with single amplitude if and only if the size of the above set depends neither on x nor on v when v≠0.

Moreover:

- for any (n,m)-function F, the value distribution of DaDbF(x) equals the value distribution of DaF(b)+DaF(x) as (a,b) ranges over (𝔽2n)2;

- if two plateuaed functions have the same distribution, then for every u, their component functions at u have the same amplitude.

Characterization in the Case of Unbalanced Components

Let F be an (n,m)-function. Then F is plateuaed with all components unbalanced if and only if, for every v,x∈𝔽2n, we have

|{(a,b)∈(𝔽2n)2:DaDbF(x)=v}|=|{(a,b)∈(𝔽2n)2:F(a)+F(b)=v}|.

Moreover, F is plateuaed with single amplitude if and only if, in addition, this value does not depend on v for v≠0.

  1. ↑ Florent Chabaud, Serge Vaudenay, Links between differential and linear cryptanalysis, Workshop on the Theory and Application of Cryptographic Techniques, 1994 May 9, pp. 356-365, Springer, Berlin, Heidelberg
  2. ↑ 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
  3. ↑ Carlet C. Boolean and vectorial plateaued functions and APN functions. IEEE Transactions on Information Theory. 2015 Nov;61(11):6272-89.