Boolean functions are usually studied under the assumption that each input bit is considered independent and identically distributed. However, in the case of some stream ciphers, a keystream bit is generated by using a nonlinear Boolean function with inputs from a restricted domain. At Eurocrypt 2016, one such stream cipher (FLIP) has been proposed, where a Boolean function on n variables was exploited with inputs of weight n/2 only. Recently, Carlet et al. studied several properties of such functions and obtained certain bounds on linear approximations of direct sum in the restricted domain. In this paper, we observe that for a direct sum like f = f1+ f2, the inputs to each sub-function f1, f2do not follow a uniform distribution in the restricted domain. In this regard, we study the properties of the Boolean functions by considering a general probability distribution on the inputs. We further obtain several bounds related to the biases of direct sums. Finally, we obtain a lower bound on the bias of the nonlinear filter function of FLIP. Our results provide a general framework to study security parameters of ciphers over restricted domain.

In this paper, we introduce generalized hyperbent functions from F2nto ℤ2k, and investigate decompositions of generalized (hyper)bent functions. We show that generalized (hyper)bent functions f from F2nto ℤ2kconsist of components which are generalized (hyper)bent functions from F2ntoZ2k'for some k' <; k. For even n, most notably we show that the g-hyperbentness of f is equivalent to the hyperbentness of the components of f with some conditions on the Walsh-Hadamard coefficients. For odd n, we show that the Boolean functions associated to a generalized bent function form an affine space of semibent functions. This complements a recent result for even n, where the associated Boolean functions are bent.