2000 character limit reached
On the linear structures of Balanced functions and quadratic APN functions (1909.11465v1)
Published 25 Sep 2019 in cs.CR and cs.DM
Abstract: The set of linear structures of most known balanced Boolean functions is nontrivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension must have a component whose set of linear structures is trivial. We determine a general form for the number of bent components in quadratic APN functions in even dimension and some bounds on the number are produced. We also count bent components in any quadratic power functions.