Borne sur le degr\'e des polyn\^omes presque parfaitement non-lin\'eaires
<|reference_start|>Borne sur le degr\'e des polyn\^omes presque parfaitement non-lin\'eaires: The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect non-linearity (APN) to study resistance to the differential attacks. Up to now, the study of functions APN was especially devoted to power functions. Recently, Budaghyan and al. showed that certain quadratic polynomials were APN. Here, we will give a criterion so that a function is not almost perfectly non-linear. H. Janwa showed, by using Weil's bound, that certain cyclic codes could not correct two errors. A. Canteaut showed by using the same method that the functions powers were not APN for a too large value of the exponent. We use Lang and Weil's bound and a result of P. Deligne on the Weil's conjectures (or more exactly improvements given by Ghorpade and Lachaud) about surfaces on finite fields to generalize this result to all the polynomials. We show therefore that a polynomial cannot be APN if its degree is too large.<|reference_end|>
@article{rodier2006borne,
    title={Borne sur le degr\'e des polyn\^omes presque parfaitement
  non-lin\'eaires},
    author={Franc{c}ois Rodier (IML)},
    journal={arXiv preprint arXiv:math/0605232},
    year={2006},
    archivePrefix={arXiv},
    eprint={math/0605232},
    primaryClass={math.AG cs.CR}
}