While performing cryptanalysis, it is of interest to approximate a Boolean function in n variables f : F n 2 → F 2 by affine functions. Usually, it is assumed that all the input vectors to a Boolean function are equiprobable while mounting affine approximation attack or fast correlation attacks. In this paper we consider a more general case when each component of the input vector to f is independent and identically distributed Bernoulli variates with the parameter p. Since our scope is within the area of cryptography, we initiate an analysis of cryptographic Boolean functions under the previous considerations and derive expression of the analogue of Walsh-Hadamard transform and nonlinearity in the case under consideration. We observe that if we allow p to take up complex values then a framework involving quantum Boolean functions can be introduced, which provides a connection between Walsh-Hadamard transform, nega-Hadamard transform and Boolean functions with biased inputs.
In this paper we find an exact formula for the number of affine equivalence classes under permutations for binary polynomials degree d = 6 invariant under the cyclic group (also, called monomial rotation symmetric), for a prime number of variables; this extends previous work for 2 ≤ d ≤ 5.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.