Construction and enumeration of the class of balanced rotation symmetric Boolean functions are important research areas in cryptography. The counting results of this class of functions are available ...only for n=p, n=2p, and n=pq (where p and q are distinct primes). An explicit formula for counting balanced rotation symmetric Boolean functions for general n has been an open problem for the last few decades. This paper solves the above open problem using the concept of k-partition of multisets with equal sums. We extend this approach to construct and enumerate the balanced rotation symmetric functions over Fp.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
The problem of counting all inequivalent monotone Boolean functions of nine variables is considered. We solve the problem using known algorithms and deriving new ones when necessary. We describe ...methods to count fixed points in sets of all monotone Boolean functions under a given permutation of input variables. With these techniques as a basis, we tabulate the cardinalities of these sets for nine variables. By applying Burnside's lemma and the numbers obtained, we calculate the number of inequivalent monotone Boolean functions of 9 variables, which equals 789,204,635,842,035,040,527,740,846,300,252,680.
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise ...structure of the codes, our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry alone implies near-optimal performance. An important consequence of this result is that a sequence of Reed-Muller codes with increasing block length and converging rate achieves capacity. This possibility has been suggested previously in the literature but it has only been proven for cases where the limiting code rate is 0 or 1. Moreover, these results extend naturally to all affine-invariant codes and, thus, to extended primitive narrow-sense BCH codes. This also resolves, in the affirmative, the existence question for capacity-achieving sequences of binary cyclic codes. The primary tools used in the proof are the sharp threshold property for symmetric monotone Boolean functions and the area theorem for extrinsic information transfer functions.
This paper provides a classification of all monotonic bipartite simple games. The problem we deal with is very versatile since simple games are inequivalent monotonic Boolean functions, functions ...that are used in many fields such as game theory, neural networks, artificial intelligence, reliability or multiple-criteria decision-making. The obtained classification can be implemented in an algorithm able to enumerate bipartite simple games. These numbers provide some light on enumerations of several subclasses of bipartite simple games, for which we find formulas.
Complete simple games, a subclass of all simple games for which the desirability relation is a complete preordering, were already classified by means of two parameters: a vector and a matrix fulfilling some conditions. Complete simple games are inequivalent monotonic regular Boolean functions. In this paper, we deduce a procedure for bipartite non-complete games, which allows enumerating the number of bipartite simple games. Several formulas are obtained, in particular polynomial expressions for the number of bicameral meet games and the number of bicameral join games, two types of voting systems widely used in practice.
Full text
Available for:
GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP
This paper is to design substitution boxes (S-Boxes) using innovative I-Ching operators (ICOs) that have evolved from ancient Chinese I-Ching philosophy. These three operators-intrication, turnover, ...and mutual- inherited from I-Ching are specifically designed to generate S-Boxes in cryptography. In order to analyze these three operators, identity, compositionality, and periodicity measures are developed. All three operators are only applied to change the output positions of Boolean functions. Therefore, the bijection property of S-Box is satisfied automatically. It means that our approach can avoid singular values, which is very important to generate S-Boxes. Based on the periodicity property of the ICOs, a new network is constructed, thus to be applied in the algorithm for designing S-Boxes. To examine the efficiency of our proposed approach, some commonly used criteria are adopted, such as nonlinearity, strict avalanche criterion, differential approximation probability, and linear approximation probability. The comparison results show that S-Boxes designed by applying ICOs have a higher security and better performance compared with other schemes. Furthermore, the proposed approach can also be used to other practice problems in a similar way.
In this paper, we make a comprehensive study of two classes of Boolean functions whose interest originally comes from hybrid symmetric-FHE encryption (with stream ciphers like FiLIP), but which also ...present much interest for general stream ciphers. The functions in these two classes are cheap and easy to implement, and they allow the resistance to all classical attacks and to their guess and determine variants as well. We determine exactly all the main cryptographic parameters (algebraic degree, resiliency order, nonlinearity, algebraic immunity) for all functions in these two classes, and we give close bounds for the others (fast algebraic immunity, the dimension of the space of annihilators of minimal degree). This is the first time that this is done for all functions in large classes of cryptographic interest.
One of the problems of modern discrete mathematics is Dedekind’s problem on the number of monotone Boolean functions. For other precomplete classes, general formulas for the number of functions of ...the classes had been found, but it has not been found so far for the class of monotone Boolean functions. Within the framework of this problem, there are problems of a lower level. One of them is the absence of a general formula for the number of Boolean functions of intersection
of two classes—the class of monotone functions and the class of self-dual functions. In the paper, new lower bounds are proposed for estimating the cardinality of the intersection for both an even and an odd number of variables. It is shown that the majority voting function of an odd number of variables is monotone and self-dual. The majority voting function of an even number of variables is determined. Free voting functions, which are functions with fictitious variables similar in properties to majority voting functions, are introduced. Then the union of a set of majority voting functions and a set of free voting functions is considered, and the cardinality of this union is calculated. The resulting value of the cardinality is proposed as a lower bound for
. For the class
of monotone self-dual functions of an even number of variables, the lower bound is improved over the bounds proposed earlier, and for functions of an odd number of variables, the lower bound for
is presented for the first time.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
A convex continuation of an arbitrary Boolean function to the set is constructed. Moreover, it is proved that for any Boolean function that has no neighboring points on the set , the constructed ...function is the only totally maximally convex continuation to . Based on this, in particular, it is constructively stated that the problem of solving an arbitrary system of Boolean equations can be reduced to the problem of minimizing a function any local minimum of which in the desired region is a global minimum, and thus for this problem the problem of local minima is completely resolved.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
10.
Optimized Homomorphic Evaluation of Boolean Functions Bon, Nicolas; Pointcheval, David; Rivain, Matthieu
IACR transactions on cryptographic hardware and embedded systems,
07/2024, Volume:
2024, Issue:
3
Journal Article
Peer reviewed
Open access
We propose a new framework to homomorphically evaluate Boolean functions using the Torus Fully Homomorphic Encryption (TFHE) scheme. Compared to previous approaches focusing on Boolean gates, our ...technique can evaluate more complex Boolean functions with several inputs using a single bootstrapping. This allows us to greatly reduce the number of bootstrapping operations necessary to evaluate a Boolean circuit compared to previous works, thus achieving significant improvements in terms of performances. We define theoretically our approach which consists in adding an intermediate homomorphic layer between the plain Boolean space and the ciphertext space. This layer relies on so-called p-encodings embedding bits into Zp. We analyze the properties of these encodings to enable the evaluation of a given Boolean function and provide a deterministic algorithm (as well as an efficient heuristic) to find valid sets of encodings for a given function. We also propose a method to decompose any Boolean circuit into Boolean functions which are efficiently evaluable using our approach. We apply our framework to homomorphically evaluate various cryptographic primitives, and in particular the AES cipher. Our implementation results show significant improvements compared to the state of the art.