Quadratic Binomial APN Functions and Absolutely Irreducible Polynomials
Eimear Byrne, Gary McGuire · arXiv (Cornell University) · 2008
We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses the Weil bound from algebraic geometry.