arXiv · 2307.12621
A Degree Bound For The c-Boomerang Uniformity Of Permutation Monomials
Abstract
Let $\mathbb{F}_q$ be a finite field of characteristic $p$. In this paper we prove that the $c$-Boomerang Uniformity, $c \neq 0$, for all permutation monomials $x^d$, where $d > 1$ and $p \nmid 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.
Explore related subjects
Keep this discovery
Matthias Johann Steiner. 2023-07-24. A Degree Bound For The c-Boomerang Uniformity Of Permutation Monomials. https://doi.org/10.1007/s00200-024-00670-6
Cite the original work for its findings. Save a collection to share your selection of sources.