The \(c\)-boomerang uniformity and \(c\)-boomerang spectrum of two classes of permutation polynomials over the finite field \(\mathbb{F}_{2^n}\) (Q6973968)

Let \(p\) be a prime and \(F\) be a permutation on \(\mathbb{F}_{p^n}\) and \((a, b)\in \mathbb{F}_{p^n}\times\mathbb{F}_{p^n}\). We define the entries of the Boomerang Connectivity Table (BCT) by \N\[\N\mathcal{B}_F (a, b) =\left|\left\{x\in\mathbb{F}_{p^n} | F^{-1}(F(x+a)+b)-F^{-1}(F(x)+b)=a\right\}\right|,\N\]\Nand the boomerang uniformity of \(F(x)\) is given by \N\[\N\mathcal{B}_F=\max_{a,b\in\mathbb{F}^*_{p^n}}\mathcal{B}_F(a, b).\N\]\NBCT and the corresponding boomerang uniformity were introduced to evaluate the resistance of a block cipher against the boomerang attack developed by \textit{D. Wagner} [Lect. Notes Comput. Sci. 1636, 156--170 (1999; Zbl 0942.94022)].\N\NIn [Discrete Appl. Math. 304, 297--314 (2021; Zbl 1473.94127)] \textit{P. Stănică} extended the notion of boomerang uniformity to \(c\)-boomerang uniformity using a multiplier differential. The entries of \(c\)-BCT are given by \N\[\N{}_c\mathcal{B}_F (a, b) =\left|\left\{x\in\mathbb{F}_{p^n} | F^{-1}(c^{-1}F(x+a)+b)-F^{-1}(cF(x)+b)=a\right\}\right|,\N\]\Nand the boomerang uniformity of \(F(x)\) is given by \N\[\N\mathcal{B}_F=\max_{a,b\in\mathbb{F}^*_{p^n}}\mathcal{B}_F(a, b).\N\]\NIn the present paper, the authors focus on two classes of permutation polynomials over \(\mathbb{F}_{2^n}\). For one of these, they show that the \(c\)-boomerang uniformity of this function is equal to 1. For the second type of function, they explicitly determine the \(c\)-boomerang spectrum of this function by means of characters and some techniques in solving equations over \(\mathbb{F}_{2^n}\).