9 research outputs found
Summary of some cryptographic criteria of functions in 8 variables
The purpose of this document is to collect the state of the art about criteria of WPB functions
in 8 variables
A unified construction of weightwise perfectly balanced Boolean functions
At Eurocrypt 2016, MĂ©aux et al. presented FLIP, a new family of stream ciphers {that aimed to enhance the efficiency of homomorphic encryption frameworks. Motivated by FLIP, recent research has focused on the study of Boolean functions with good cryptographic properties when restricted to subsets of the space . If an -variable Boolean function has the property of balancedness when restricted to each set of vectors with fixed Hamming weight between and , it is a weightwise perfectly balanced (WPB) Boolean function. In the literature, a few algebraic constructions of WPB functions are known, in which there are some constructions that use iterative method based on functions with low degrees of 1, 2, or 4. In this paper, we generalize the iterative method and contribute a unified construction of WPB functions based on functions with algebraic degrees that can} be any power of 2. For any given positive integer not larger than , we first provide a class of -variable Boolean functions with a degree of . Utilizing these functions, we then present a construction of -variable WPB functions . In particular, includes four former classes of WPB functions as special cases when . When takes other integer values, has never appeared before. In addition, we prove the algebraic degree of the constructed WPB functions and compare the weightwise nonlinearity of WPB functions known so far in 8 and 16 variables
Weightwise almost perfectly balanced functions: secondary constructions for all n and better weightwise nonlinearities
The design of FLIP stream cipher presented at Eurocrypt motivates the study of Boolean functions with good cryptographic criteria when restricted to subsets of .
Since the security of FLIP relies on properties of functions restricted to subsets of constant Hamming weight, called slices, several studies investigate functions with good properties on the slices, i.e. weightwise properties. A major challenge is to build functions balanced on each slice, from which we get the notion of Weightwise Almost Perfectly Balanced (WAPB) functions.
Although various constructions of WAPB functions have been exhibited since , building WAPB functions with high weightwise nonlinearities remains a difficult task. Lower bounds on the weightwise nonlinearities of WAPB functions are known for very few families, and exact values were computed only for functions in at most variables.
In this article, we introduce and study two new secondary constructions of WAPB functions. This new strategy allows us to bound the weightwise nonlinearities from those of the parent functions, enabling us to produce WAPB functions with high weightwise nonlinearities.
As a practical application, we build several novel WAPB functions in up to variables by taking parent functions from two different known families. Moreover, combining these outputs, we also produce the -variable WAPB function with the highest weightwise nonlinearities known so far
On the algebraic immunity of weightwise perfectly balanced functions
In this article we study the Algebraic Immunity (AI) of Weightwise Perfectly Balanced (WPB) functions.
After showing a lower bound on the AI of two classes of WPB functions from the previous literature, we prove that the minimal AI of a WPB -variables function is constant, equal to for .
Then, we compute the distribution of the AI of WPB function in variables, and estimate the one in and variables.
For these values of we observe that a large majority of WPB functions have optimal AI, and that we could not obtain an AI- WPB function by sampling at random.
Finally, we address the problem of constructing WPB functions with bounded algebraic immunity, exploiting a construction from 2022 by Gini and MĂ©aux. In particular, we present a method to generate multiple WPB functions with minimal AI, and we prove that the WPB functions with high nonlinearity exhibited by Gini and MĂ©aux also have minimal AI. We conclude with a construction giving WPB functions with lower bounded AI, and give as example a family with all elements with AI at least
On the cryptographic properties of weightwise affine and weightwise quadratic functions
Weightwise degree-d functions are Boolean functions that take the values of a function of degree at most d on each set of fixed Hamming weight. The class of weightwise affine functions encompasses both the symmetric functions and the Hidden Weight Bit Function (HWBF). The good cryptographic properties of the HWBF, except for the nonlinearity, motivates to investigate a larger class with functions that share the good properties and have a better nonlinearity. Additionally, the homomorphic friendliness of symmetric functions exhibited in the context of hybrid homomorphic encryption and the recent results on homomorphic evaluation of Boolean functions make this class of functions appealing for efficient privacy-preserving protocols.
In this article we realize the first study on weightwise degree-d functions, focusing on weightwise affine and weightwise quadratic functions. We show some properties on these new classes of functions, in particular on the subclass of cyclic weightwise functions. We provide balanced constructions and prove nonlinearity lower bounds for all cyclic weightwise affine functions and for a family of weightwise quadratic functions. We complement our work with experimental results, they show that other cyclic weightwise linear functions than the HWBF have better cryptographic parameters, and considering weightwise quadratic functions allows to reach higher algebraic immunity and substantially better nonlinearity
On the cryptographic properties of weightwise affine and weightwise quadratic functions
Weightwise degree-d functions are Boolean functions that take the values of a function of degree at most d on each set of fixed Hamming weight.
The class of weightwise affine functions encompasses both the symmetric functions and the Hidden Weight Bit Function (HWBF).
The good cryptographic properties of the HWBF, except for the nonlinearity, motivates to investigate a larger class with functions that share the good properties and have a better nonlinearity.
Additionally, the homomorphic friendliness of symmetric functions exhibited in the context of hybrid homomorphic encryption and the recent results on homomorphic evaluation of Boolean functions make this class of functions appealing for efficient privacy-preserving protocols.
In this article we realize the first study on weightwise degree-d functions, focusing on weightwise affine and weightwise quadratic functions.
We show some properties on these new classes of functions, in particular on the subclass of cyclic weightwise functions. We provide balanced constructions and prove nonlinearity upper bounds for all cyclic weightwise affine functions and for a family of weightwise quadratic functions. We complement our work with experimental results, they show that other cyclic weightwise linear functions than the HWBF have better cryptographic parameters, and considering weightwise quadratic functions allows to reach higher algebraic immunity and substantially better nonlinearity