Algorithms for computing the permutation resemblance of functions over finite groups

arXiv2302.04300MaRDI QIDQ6425879FDOQ6425879

Publication date: 8 February 2023

Abstract: Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming techniques. We also present an algorithm for constructing feasible solutions to this integer program, and use it to prove an upper bound for permutation resemblance for some special functions. Additionally, we present a generalization of the linear integer program that takes a function on a finite group and determines a permutation with the lowest differential uniformity among those most resembling it.

Mathematics Subject Classification ID

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

This page was built for publication: Algorithms for computing the permutation resemblance of functions over finite groups

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