Partially APN Boolean functions and classes of functions that are not APN infinitely often
Information Theory
2019-05-31 v1 Combinatorics
math.IT
Abstract
In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition. We connect this notion to the known conjecture that APN functions modified at a point cannot remain APN. In the second part of the paper, we find conditions for some transformations not to be partially APN, and in the process, we find classes of functions that are never APN for infinitely many extensions of the prime field , extending some earlier results of Leander and Rodier.
Keywords
Cite
@article{arxiv.1905.13025,
title = {Partially APN Boolean functions and classes of functions that are not APN infinitely often},
author = {Lilya Budaghyan and Nikolay S. Kaleyski and Soonhak Kwon and Constanza Riera and Pantelimon Stanica},
journal= {arXiv preprint arXiv:1905.13025},
year = {2019}
}
Comments
24 pages; to appear in Cryptography and Communications