Permutation resemblance

Publication date 6 February 2023

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Special polynomials in general fields (12E10) Finite fields (field-theoretic aspects) (12E20)

Abstract: Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce the notion of permutation resemblance of a function, which looks to measure the distance a given map is from being a permutation. We prove several results concerning permutation resemblance and show how it can be used to produce low differentially uniform bijections. We also study the permutation resemblance of planar functions, which over fields of odd characteristic are known not to be bijections and to have the optimal differential uniformity.

This page was built for publication: Permutation resemblance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425627)