Polynomial functions of degree 20 which are APN infinitely often

2012/12/19 by Caullery, Florian
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1212.4638

Abstract

We give all the polynomials functions of degree 20 which are APN over an infinity of field extensions and show they are all CCZ-equivalent to the function x⁵, which is a new step in proving the conjecture of Aubry, McGuire and Rodier.

Related

• A new large class of functions not APN infinitely often
• On the Conjecture on APN Functions
• A Few More Quadratic APN Functions
• Quadratic Binomial APN Functions and Absolutely Irreducible Polynomials
• On the infiniteness of a family of APN functions