Non-trivial automorphism conjecture for APN functions and permutations

About 6 years old · traced to

Let F ⁣:F2n→F2nF\colon\mathbb{F}_2^n\rightarrow\mathbb{F}_2^n be an APN function, and let Aut(F)\mathsf{Aut}(F) denote its automorphism group. If FF is an APN permutation, let AutLE(F)\mathsf{Aut_{LE}}(F) denote its group of LE-automorphisms. Two functions are CCZ-equivalent when their graphs are related by an affine permutation of the product space. Non-trivial automorphism conjecture. For every APN function F ⁣:F2n→F2nF\colon\mathbb{F}_2^n\rightarrow\mathbb{F}_2^n, we have

∣Aut(F)∣>1.|\mathsf{Aut}(F)|>1.

Moreover, if FF is an APN permutation, there exists a CCZ-equivalent permutation GG such that

∣AutLE(G)∣>1.|\mathsf{Aut_{LE}}(G)|>1.

All known APN functions have non-trivial automorphism groups, and all known APN permutations have a CCZ-equivalent representative with a non-trivial LE-automorphism; the conjecture asserts that these observed properties hold in general.

References

Primary source

Christof Beierle, Marcus Brinkmann and Gregor Leander, “Linearly Self-Equivalent APN Permutations in Small Dimension”, arXiv:2003.12006 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.