509 research outputs found
Construction of cubic homogeneous boolean bent functions
We prove that cubic homogeneous bent functions f : V2n → GF(2) exist for all n ≥ 3 except for n = 4
On the Systematic Constructions of Rotation Symmetric Bent Functions with Any Possible Algebraic Degrees
In the literature, few constructions of -variable rotation symmetric bent
functions have been presented, which either have restriction on or have
algebraic degree no more than . In this paper, for any even integer
, a first systemic construction of -variable rotation symmetric
bent functions, with any possible algebraic degrees ranging from to , is
proposed
A Computational Search for Cubic-Like Bent Functions
Boolean functions are a central topic in computer science. A subset of Boolean functions, Bent Boolean functions, provide optimal resistance to various cryptographical attack vectors, making them an interesting subject for cryptography, as well as many other branches of mathematics and computer science. In this work, we search for cubic Bent Boolean functions using a novel characterization presented by Carlet & Villa in [CV23]. We implement a tool for the search of Bent Boolean functions and cubic-like Bent Boolean functions, allowing for constraints to be set on the form of the ANF of Boolean functions generated by the tool; reducing the search space required for an exhaustive search. The tool guarantees efficient traversal of the search space without redundancies. We use this tool to perform an exhaustive search for cubic-like Bent Boolean functions in dimension 6. This search proves unfeasible for dimension 8 and higher. We further attempt to find novel instances of Bent functions that are not Maioarana-McFarland in dimension 10 but fail to find any interesting results. We conclude that the proposed characterization does not yield a significant enough reduction of the search space to make the classification of cubic Bent Boolean functions of dimensions 8 or higher viable; nor could we use it to produce new instances of cubic Bent Boolean functions in 10 variables.Masteroppgave i informatikkINF399MAMN-PROGMAMN-IN
Heuristic search of (semi-)bent functions based on cellular automata
An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions: given a known function with a good cryptographic profile, the aim is to extend it to a (usually larger) function possessing analogous properties. In this work, we continue the investigation of a secondary construction based on cellular automata (CA), focusing on the classes of bent and semi-bent functions. We prove that our construction preserves the algebraic degree of the local rule, and we narrow our attention to the subclass of quadratic functions, performing several experiments based on exhaustive combinatorial search and heuristic optimization through Evolutionary Strategies (ES). Finally, we classify the obtained results up to permutation equivalence, remarking that the number of equivalence classes that our CA-XOR construction can successfully extend grows very quickly with respect to the CA diameter
Bent functions in the partial spread class generated by linear recurring sequences
We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if their feedback polynomials are relatively prime. Then, we characterize the appropriate parameters for a family of pairwise coprime polynomials to generate a partial spread required for the support of a bent function, showing that such families exist if and only if the degrees of the underlying polynomials are either 1 or 2. We then count the resulting sets of polynomials and prove that, for degree 1, our LRS construction coincides with the Desarguesian partial spread. Finally, we perform a computer search of all PS− and PS+ bent functions of n=8 variables generated by our construction and compute their 2-ranks. The results show that many of these functions defined by polynomials of degree d=2 are not EA-equivalent to any Maiorana–McFarland or Desarguesian partial spread function
Algebraic normal form of a bent function: properties and restrictions
Maximally nonlinear Boolean functions in variables, where n is
even, are called bent functions. There are several ways to represent
Boolean functions. One of the most useful is via algebraic normal
form (ANF). What can we say about ANF of a bent function? We try to
collect all known and new facts related to ANF of a bent function. A
new problem in bent functions is stated and studied: is it true that
a linear, quadratic, cubic, etc. part of ANF of a bent function can
be arbitrary? The case of linear part is well studied before. In
this paper we prove that a quadratic part of a bent function can be
arbitrary too
- …