Two shorter proofs on the inverse and differential spectrum of Bracken-Leander exponent (Q2237232)

The Bracken-Leander power function \(F(x)=x^{2^{2k}+2^k+1}\), defined over \(\mathbb{F}_{2^{4k}}\) for \(k\) odd, is a differentially \(4\)-uniform permutation. In this paper, it is given an alternative and much shorter proof on the binary representation of its inverse based on the Chinese Remainder Theorem. The inverse of \(F\) has been recently obtained in [\textit{L. Kölsch}, Des. Codes Cryptography 88, No. 12, 2597--2621 (2020; Zbl 1477.11197)] with a very involved proof. Moreover, based on a known connection between the differential spectrum and the Walsh spectrum of a vectorial Boolean function, the author gives another shorter proof to determine the differential spectrum of \(F\), which was obtained in [\textit{M. Xiong} and \textit{H. Yan}, Finite Fields Appl. 48, 117--125 (2017; Zbl 1398.11148)] by analyzing the exact number of solutions of the equations obtained from the derivatives of \(F\).