You are looking at a specific version 20200614:201709 of this paper. See the latest version.

Paper 2020/705

On the minimal value set size of APN functions

Ingo Czerwinski

Abstract

We give a lower bound for the size of the value set of almost perfect nonlinear (APN) functions \(F\colon \mathbb{F}_{2^n} \to \mathbb{F}_{2^n}\). For \(n\) even it is \(\frac{ 2^n + 2 }{3}\) and sharp as the simple example \(F(x) = x^3\) shows. The sharp lower bound for \(n\) odd has to lie between \(\frac{ 2^n + 1 }{3}\) and \(2^{n-1}\). Sharp bounds for the cases \(n = 3\) and \(n = 5\) are explicitly given.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Boolean functionsCryptographic S-boxesAlmost perfect nonlinear (APN)Value set size
Contact author(s)
ingo @ czerwinski eu
History
2021-05-05: revised
2020-06-14: received
See all versions
Short URL
https://ia.cr/2020/705
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.