On Equivalence of Known Families of APN Functions in Small Dimensions
This work provides a computational resource for researchers in cryptography and finite fields, but it is incremental as it extends known methods to specific dimensions.
The authors computationally identified CCZ-inequivalent APN functions from infinite families on finite fields for dimensions 6 to 11, selecting those with simplest coefficients to simplify equivalence checking between any APN function and these families.
In this extended abstract, we computationally check and list the CCZ-inequivalent APN functions from infinite families on $\mathbb{F}_2^n$ for n from 6 to 11. These functions are selected with simplest coefficients from CCZ-inequivalent classes. This work can simplify checking CCZ-equivalence between any APN function and infinite APN families.