On sets determining the differential spectrum of mappings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Information and Coding Theory Year : 2017

On sets determining the differential spectrum of mappings

Abstract

The differential uniformity of a mapping $F : F 2 n → F 2 n$ is defined as the maximum number of solutions $x$ for equations $F (x+a)+F (x) = b$ when $a ̸ = 0$ and $b$ run over $F 2 n$. In this paper we study the question whether it is possible to determine the differential uniformity of a mapping by considering not all elements $a ̸ = 0$, but only those from a special proper subset of $F 2 n \ {0}$. We show that the answer is " yes " , when $F$ has differential uniformity 2, that is if $F$ is APN. In this case it is enough to take $a ̸ = 0$ on a hyperplane in $F 2 n$. Further we show that also for a large family of mappings F of a special shape, it is enough to consider a from a suitable multiplicative subgroup of $F 2 n$ .
Fichier principal
Vignette du fichier
Charpin-Kyureghyan-18.pdf (116.65 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01406589 , version 1 (01-12-2016)
hal-01406589 , version 2 (14-05-2018)
hal-01406589 , version 3 (17-05-2018)

Identifiers

Cite

Pascale Charpin, Gohar M. Kyureghyan. On sets determining the differential spectrum of mappings. International Journal of Information and Coding Theory, 2017, 4 (2/3), pp.170--184. ⟨10.1504/IJICOT.2017.083844⟩. ⟨hal-01406589v3⟩

Collections

INRIA INRIA2
218 View
435 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More