On APN functions in odd characteristic, the disproof of a conjecture and related problems
By: Daniele Bartoli, Pantelimon Stanica
Potential Business Impact:
Cracks secret codes by finding their weaknesses.
In this paper disprove a conjecture by Pal and Budaghyan (DCC, 2024) on the existence of a family of APN permutations, but showing that if the field's cardinality $q$ is larger than~$9587$, then those functions will never be APN. Moreover, we discuss other connected families of functions, for potential APN functions, but we show that they are not good candidates for APNess if the underlying field is large, in spite of the fact that they though they are APN for small environments.
Similar Papers
On Known APNs
Discrete Mathematics
Finds fewer ways to make secret codes.
On the Classification of Dillon's APN Hexanomials
Number Theory
Finds better ways to scramble secret codes.
On the Classification of Dillon's APN Hexanomials
Number Theory
Finds better ways to scramble secret codes.