Inspired by the previous work of Tu and Deng, we propose two infinite classes of Boolean
functions of 2 k variables where k≥ 2. The first class contains unbalanced functions having …

In this paper, three constructions of balanced Boolean functions with optimal algebraic
immunity are proposed. It is checked that, at least for small numbers of input variables, these …

In this article we improve the lower bound on the maximum nonlinearity of 1-resilient
Boolean functions, for n even, by proposing a method of constructing this class of functions …

In this paper, we give an efficient method for constructing a large set of disjoint spectra
functions without linear structures, which are not equivalent to partially linear functions. This …

In 2013, Tang, Carlet, and Tang [IEEE TIT 59 (1): 653-664, 2013] presented two classes of
Boolean functions. The functions in the first class are unbalanced and the functions in the …

Goldreich's pseudorandom generator is a well-known building block for many theoretical
cryptographic constructions from multi-party computation to indistinguishability obfuscation …

Just over a decade ago, the first comprehensive review on the state of benchmarking in
Genetic Programming (GP) analyzed the mismatch between the problems that are used to …

The multiplicative complexity (MC) is a cryptographic criterion that describes the vulnerability
of a Boolean function to certain algebraic attacks, and in many important cryptographic …

Recently, Tang, Carlet and Tang presented a combinatorial conjecture about binary strings,
allowing proving that all balanced functions in some infinite class they introduced have …

This paper is devoted to Boolean functions for cryptography; more precisely those which can
be used for filtering linear feedback shift registers, in the pseudo-random generators of …