# On CCZ-equivalence of the inverse function

Source: [On CCZ-equivalence of the inverse function](<https://www.sota2.com/research/paper/68fa57de1e209131ce9a913a>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T14:58:37.618Z

Authors: Lukas K\\"olsch

Published: 2020-08-19T12:29:52.000Z

## Abstract

The inverse function $x \\mapsto 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 $n\\geq 5$, 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 $n\\geq 5$, where $L\_1,L\_2$ are nonzero linear functions. In the proof, we combine Kloosterman sums, quadratic forms and tools from additive combinatorics.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2008.08398>)

[PDF](<https://arxiv.org/pdf/2008.08398.pdf>)
