Partially APN Boolean functions and classes of functions that are not APN infinitely often

May 30, 2019 Β· Declared Dead Β· πŸ› Cryptography and Communications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Lilya Budaghyan, Nikolay S. Kaleyski, Soonhak Kwon, Constanza Riera, Pantelimon Stanica arXiv ID 1905.13025 Category cs.IT: Information Theory Cross-listed math.CO Citations 15 Venue Cryptography and Communications Last Checked 4 months ago
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 $\F_2$, extending some earlier results of Leander and Rodier.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted