2000 character limit reached
Using double Weil sums in finding the $c$-Boomerang Connectivity Table for monomial functions on finite fields
Published 19 Jul 2020 in math.NT, cs.IT, and math.IT | (2007.09553v3)
Abstract: In this paper we characterize the $c$-Boomerang Connectivity Table (BCT), $c\neq 0$ (thus, including the classical $c=1$ case), for all monomial function $xd$ in terms of characters and Weil sums on the finite field~$\F_{pn}$. We further simplify these expressions for the Gold functions $x{pk+1}$ for all $1\leq k<n$, and $p$ odd. It is the first such attempt for a complete description for the classical BCT and its relative $c$-BCT, for all parameters involved.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.