A Degree Bound For The c-Boomerang Uniformity Of Permutation Monomials
share
Let 𝔽_q be a finite field of characteristic p. In this paper we prove that the c-Boomerang Uniformity, c ≠ 0, for all permutation monomials x^d, where d > 1 and p ∤ d, is bounded by d^2. Further, we utilize this bound to estimate the c-boomerang uniformity of a large class of Generalized Triangular Dynamical Systems, a polynomial-based approach to describe cryptographic permutations, including the well-known Substitution-Permutation Network.
READ FULL TEXT
