On CCZ-Equivalence of the Inverse Function

DOI10.1109/TIT.2021.3065068MaRDI QIDQ5001832zbMATH OpenOpenAlexFDO

Authors Lukas Kölsch

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Abstract: The inverse function $xmapsto{x}^{-1}$ on $mathbb{F}_{2^n}$ is one of the most studied functions in cryptography due to its widespread use as an S-box in block ciphers like AES. In this paper, we show that, if $ngeq5$, every function that is CCZ-equivalent to the inverse function is already EA-equivalent to it. This confirms a conjecture by Budaghyan, Calderini and Villa. We also prove that every permutation that is CCZ-equivalent to the inverse function is already affine equivalent to it. The majority of the paper is devoted to proving that there are no permutation polynomials of the form $L_1(x^{-1})+L_2(x)$ over $mathbb{F}_{2^n}$ if $ngeq5$, where $L_1,L_2$ are nonzero linear functions. In the proof, we combine Kloosterman sums, quadratic forms and tools from additive combinatorics.

Cited in

(3)

• On known constructions of APN and AB functions and their relation to each other
• Two classes of permutation trinomials over \(\mathbb{F}_{q^3}\) in characteristic two
• On the functions which are CCZ-equivalent but not EA-equivalent to quadratic functions over \(\mathbb{F}_{p^n}\)

This page was built for publication: On CCZ-Equivalence of the Inverse Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001832)