On the Normality of Boolean quartics
Abstract.
In the BFA’2023 conference paper, A. Polujan, L. Mariot and S. Picek exhibited the first example of a non-normal but weakly normal bent function in dimension 8. In this note, we present numerical approaches based on the classification of Boolean spaces to explore in detail the normality of bent functions of 8 variables and we complete S. Dubuc’s results for dimensions less or equal to 7. Based on our investigations, we show that all bent functions in 8 variables are normal or weakly normal. Finally, we conjecture that more generally all Boolean functions of degree at most 4 in 8 variables are normal or weakly normal.
1. Introduction
In the context of random generation of non-normal bent functions in 8 variables, a non-normal but weakly normal bent quartic was presented by A. Polujan, L. Mariot and S. Picek at BFA’2023; see [9]. Furthermore, a non-normal function of degree 6 in 8 variables was presented by S. Dubuc in her PhD thesis, and we verify that this function is in fact weakly normal. For that dimension, the main question concerns the existence of Boolean functions that are neither normal nor weakly normal, we will say abnormal. For that purpose, we propose a numerical approach based on the classification of Boolean spaces under the action of the affine general linear group to study the relative degree of Boolean functions. We namely use most of the old [8] and recent [5] classification results obtained in the last decade to analyse the maximal relative degree that a Boolean function can have. Our main objective is to update the knowledge of Boolean functions in small dimensions, thus completing the results in the PhD work of S. Dubuc [4], and answering definitively on the (weak)-normality of bent function and related questions in 8 variables.
Let be the finite field of order . Let be a positive integer. We denote the set of Boolean functions . Every Boolean function has a unique algebraic reduced representation:
(1) |
The degree of is the maximal cardinality of with in the algebraic form. In this paper, we conventionally fix the degree of the null function to zero. We denote by the space of Boolean functions of valuation greater than or equal to and of degree less than or equal to . Note that whenever . The affine general linear group of , denoted by , acts naturally over all these spaces. A system of representatives of is denoted . In next sections, we are using the classifications available in the project [7], more precisely those which interest us here are listed in Table 1.
206 |
2. Normality and Relative degree
Let be a linear subspace of , we denote the space of Boolean functions from to . For , we denote the Boolean function of defined by .
The notion of normality was introduced by Dobbertin [3]. In this paper, we use the following terminologies of P. Charpin [2]. A Boolean function is said to be normal if there exists an affine subspace of with dimension where is constant i.e. . The function is weakly normal when is affine, and not constant i.e. , on an affine space of dimension .
Example 1.
For a positive integer , the quadric is not normal, but weakly normal in .
The normality of Boolean functions is an invariant under the action of .
Now, we introduce the relative degree that generalizes normality notions. The relative degree of with respect the affine space is the degree of , denoted by: . Note that if , then . We define the -degree of as the minimal relative degree of for all affine spaces , where :
Notions of normality are translated into
For integers and , we propose to study the following combinatorial parameter
As we will see, it may be interesting to look at more closely what is happening by degree, for that the denote by the maximum over the Boolean functions of degree equal to . In general, the determination of seems to be a hard problem. Since the affine general linear group acts on the set of affine space of given dimension preserving the degree of functions, whence the relative degrees are affine invariants of . So, we can use the result of classification of Boolean functions to determine some of these parameters. Each space of dimension (-space) of has cosets and the number of -spaces is given by Gauss binomial coefficient . Taking into account the cost of the computation of the degree of a Boolean function, the work factor to determine the -relative degree of function in by brute force:
For , and , the work factor is about . So, we complete the tables and in a matter of minutes, using a 80-core computer. But, since , we can not reasonably use brute force in dimension .
1 | 2 | 3 | 4 | 5 | |
---|---|---|---|---|---|
4 | 0 | 2 | 2 | 3 | 2 |
3 | 0 | 1 | 1 | 1 | 1 |
2 | 0 | 0 | 0 | 0 | 0 |
1 | 2 | 3 | 4 | 5 | 6 | |
---|---|---|---|---|---|---|
5 | 0 | 2 | 3 | 4 | 3 | 4 |
4 | 0 | 2 | 2 | 2 | 2 | 2 |
3 | 0 | 0 | 0 | 0 | 0 | 0 |
2 | 0 | 0 | 0 | 0 | 0 | 0 |
1 | 2 | 3 | 4 | 5 | 6 | 7 | |
---|---|---|---|---|---|---|---|
6 | 0 | 2 | 3 | 5 | |||
5 | 0 | 2 | 3 | ||||
4 | 0 | 1 | 1 | ||||
3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Numerical fact 1.
Using the classification of , we complete the table . As proved in [4], all the functions in are normal. We point this implies that , for all .
Among the 12 members of , all have 6-relative degree 0 except
for which fixing the entry (6,6) of the table .
Numerical fact 2.
Using the classification of , we fill the left part of the table . All cubics in are normal or weakly normal.
The minoration in the right part of the table were obtained at random, by adding a random cubic to the members of . The computation suggests the non-existence of abnormal quartic :
Conjecture 1.
All the quartics of are normal or weakly normal.
Remark 1.
Verifying the previous conjecture, which consists of listing all the functions of the form form with and i.e. functions, does not seem numerically out of reach.
3. Normality in dimension 8
In her PhD thesis, S. Dubuc gave and presented the first example of a non-normal function. It has degree 6 comprising 140 monomials, but we checked that this function is weakly normal and equivalent to the following one:
She also proved that all the bent cubics in 8 variables are normal. A fact that we can improve strongly in two ways, by proving that all 8-bit cubics are normal or weakly normal and by proving that all 8-bit bent functions are normal or weakly normal.
Problem 1.
Does there exist a Boolean function with 4-relative degree 2?
Proposition 1.
All the cubics in are normal or weakly normal.
Proof.
The distribution by relative degrees of the representatives of is given in Table 3. For example, the entry (6,1) which is 21 means that there are 21 cubics of 6-relative degrees equal to 1. The distribution for gives the result. ∎
0 | 1 | 2 | 3 | |
---|---|---|---|---|
8 | ||||
7 | ||||
6 | ||||
5 | ||||
4 |
Remark 2.
An alternative proof of the previous proposition is to use the numerical fact 2. Indeed, for and for any hyperplane , the restriction of to is a cubic in .
We say that a homogeneous quartic in is bentable, if there exists a Boolean cubic in such that is bent. In that case, we say that has type , where is the order of the stabilizer of in . It is known [8] that 536 of the 999 classes of , are bentable and they can be arranged in 418 classes using the notion of the dual bent function. At BFA’2023, A. Polujan, L. Mariot and S. Picek [9] presented the first example of a non-normal bent quartic in 8 variables. This example belongs to the partial spread class and has type .
Numerical fact 3.
It is known that up duality, there are 25 bentable homogeneous quartics of type , providing classes of bent functions, in which we identify 361 classes of non-normal but weakly normal bent functions.
To decide on the normality of a large set of 8-bit bent functions, we use a rather approach initialized by the pre-computation of the affine 3-spaces as a list of 3-spaces and their 32 cosets. A Boolean function is weakly normal is there exists a pair of cosets of the same 3-space on which is constant. If takes the same value on these cosets then it is normal. Using a bit programming implementation in C, we were able to show the following result.
Numerical fact 4.
All the bent functions in are normal or weakly normal.
We have adapted the counting method presented in [8] to enumerate a cover-set of 8-bit bent functions of degree 4. This cover set contains bent functions and data are available in [6]. Checking the normality or weak normality of these functions, we were able to otain fact 4. Since 8-bit bent functions have a degree of at most 4, the previous result leads us to consider a more general phenomenon :
Conjecture 2.
All the Boolean quartics in are normal or weakly normal.
In the space of homogeneous quadratic forms of 8 variables, a space of dimension 28, the degree of Boolean indicator of bent functions has degree 4 in B(8) . This last conjecture is an attempt to precise the structure of the set of bent functions within the space of components of a 8-bit APN function.
Acknowledgments
Philippe Langevin is partially supported by the French Agence Nationale de la Recherche through the SWAP project under Contract ANR-21-CE39-0012.
References
- [1] Anne Canteaut, Magnus Daum, Hans Dobbertin, and Gregor Leander. Finding nonnormal bent functions. Discret. Appl. Math., 154(2):202–218, 2006.
- [2] Pascale Charpin. Normal Boolean functions. Journal of Complexity, 20(2):245–265, 2004. Festschrift for Harald Niederreiter, Special Issue on Coding and Cryptography.
- [3] Hans Dobbertin. Construction of bent functions and balanced Boolean functions with high nonlinearity. In Bart Preneel, editor, Fast Software Encryption, pages 61–74, Berlin, Heidelberg, 1995. Springer Berlin Heidelberg.
- [4] Sylvie Dubuc. Etude des propriétés de dégénérescence et de normalité des fonctions booléennes et construction de fonctions q-aires parfaitement non-linéaires. PhD thesis, University of Caen, 2001.
- [5] Valérie Gillot and Philippe Langevin. Classification of some cosets of Reed-Muller codes. Cryptography and Communications, 15:1129–1137, 2023. doi:10.1007/s12095-023-00652-4.
- [6] Valérie Gillot and Philippe Langevin. Classification of 8-bit bent functions. https://langevin.univ-tln.fr/project/genbent/genbent.html.
- [7] Valérie Gillot and Philippe Langevin. Classification of . http://langevin.univ-tln.fr/data/bst/.
- [8] Philippe Langevin and Gregor Leander. Counting all bent functions in dimension eight 99270589265934370305785861242880. Designs, Codes Cryptography 59(1-3), 59(1-3):193–205, 2011.
- [9] Alexandr Polujan, Luca Mariot, and Stjepan Picek. Normality of Boolean bent functions in eight variables, revisited. In The 8th International Workshop on Boolean Functions and their Applications, pages 79–83, 2023.