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

DOI10.1007/s12095-019-00372-8zbMath1458.94218arXiv1905.13025OpenAlexW2947669364WikidataQ127727505 ScholiaQ127727505MaRDI QIDQ2202897

Constanza Riera, Lilya Budaghyan, Soonhak Kwon, Nikolay Kaleyski, Pantelimon Stănică

Publication date: 30 September 2020

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.13025

zbMATH Keywords

Boolean functionalmost perfect nonlinear (APN)partial APNWalsh-Hadamard coefficients

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Topological lattices (06B30) Boolean functions (94D10)

Related Items (3)

On the behavior of some APN permutations under swapping points ⋮ Partially APN functions with APN-like polynomial representations ⋮ An infinite family of 0-APN monomials with two parameters

Cites Work

• Functions of degree \(4e\) that are not APN infinitely often
• On some block ciphers and imprimitive groups
• Constructing new APN functions from known ones
• On sets determining the differential spectrum of mappings
• Bounds on the degree of APN polynomials: the case of \(x^{-1} + g(x)\)
• A few more functions that are not APN infinitely often
• Construction and Analysis of Cryptographic Functions
• On Upper Bounds for Algebraic Degrees of APN Functions
• Some more functions that are not APN infinitely often. The case of Gold and Kasami exponents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partially APN Boolean functions and classes of functions that are not APN infinitely often