Zeros of special polynomials and their impact on a class of APN functions
Daniele Bartoli, Marco Calderini, Giuseppe Marino, Francesco Pavese

TL;DR
This paper investigates the zeros of specific polynomials related to APN functions over finite fields, establishing non-existence results for certain parameter ranges and thus constraining possible constructions of these cryptographic functions.
Contribution
It provides a non-existence proof for a class of APN functions based on polynomial zero conditions, especially for larger field sizes and certain parameter values.
Findings
Non-existence of the polynomial construction for m ≥ 8 when r=1.
Application of algebraic variety techniques over finite fields.
Constraints on the existence of APN functions in the studied family.
Abstract
In 2021, Calderini et al. introduced a construction for APN functions on in bivariate form They showed that this family exists provided the existence of a polynomial with no zeros in . For it was shown that we can have APN functions belonging to this family. However, up to now, no construction of such polynomials is known for . In this work we provide a non-existence result of such functions whenever , by application of techniques from algebraic varieties over finite fields. In particular, for we have that the construction of Calderini et al. cannot provide an APN function for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · Mathematical functions and polynomials
