713 research outputs found
Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
In this paper, a technique on constructing nonlinear resilient Boolean
functions is described. By using several sets of disjoint spectra functions on
a small number of variables, an almost optimal resilient function on a large
even number of variables can be constructed. It is shown that given any ,
one can construct infinitely many -variable ( even), -resilient
functions with nonlinearity . A large class of highly
nonlinear resilient functions which were not known are obtained. Then one
method to optimize the degree of the constructed functions is proposed. Last,
an improved version of the main construction is given.Comment: 14 pages, 2 table
Algorithm 959: VBF: A Library of C plus plus Classes for Vector Boolean Functions in Cryptography
VBF is a collection of C++ classes designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This implementation uses the NTL library from Victor Shoup, adding new modules that call NTL functions and complement the existing ones, making it better suited to cryptography. The class representing a vector Boolean function can be initialized by several alternative types of data structures such as Truth Table, Trace Representation, and Algebraic Normal Form (ANF), among others. The most relevant cryptographic criteria for both block and stream ciphers as well as for hash functions can be evaluated with VBF: it obtains the nonlinearity, linearity distance, algebraic degree, linear structures, and frequency distribution of the absolute values of the Walsh Spectrum or the Autocorrelation Spectrum, among others. In addition, operations such as equality testing, composition, inversion, sum, direct sum, bricklayering (parallel application of vector Boolean functions as employed in Rijndael cipher), and adding coordinate functions of two vector Boolean functions are presented. Finally, three real applications of the library are described: the first one analyzes the KASUMI block cipher, the second one analyzes the Mini-AES cipher, and the third one finds Boolean functions with very high nonlinearity, a key property for robustness against linear attacks
Patterson-Wiedemann type functions on 21 variables with Nonlinearity greater than Bent Concatenation bound
Nonlinearity is one of the most challenging combinatorial property in the domain of Boolean function research. Obtaining nonlinearity greater than the bent concatenation bound for odd number of variables continues to be one of the most sought after combinatorial research problems. The pioneering result in this direction has been discovered by Patterson and Wiedemann in 1983 (IEEE-IT), which considered Boolean functions on variables that are invariant under the actions of the cyclic group as well as the group of Frobenius authomorphisms. Some of these Boolean functions posses nonlinearity greater than the bent concatenation bound. The next
possible option for exploring such functions is on variables. However, obtaining such functions remained elusive for more than three decades even after substantial efforts as evident in the literature. In this paper, we exploit combinatorial arguments together with heuristic search to demonstrate such functions for the first time
Systematic Constructions of Bent-Negabent Functions, 2-Rotation Symmetric Bent-Negabent Functions and Their Duals
Bent-negabent functions have many important properties for their application
in cryptography since they have the flat absolute spectrum under the both
Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present
four new systematic constructions of bent-negabent functions on
and variables, respectively, by modifying the truth tables of two
classes of quadratic bent-negabent functions with simple form. The algebraic
normal forms and duals of these constructed functions are also determined. We
further identify necessary and sufficient conditions for those bent-negabent
functions which have the maximum algebraic degree. At last, by modifying the
truth tables of a class of quadratic 2-rotation symmetric bent-negabent
functions, we present a construction of 2-rotation symmetric bent-negabent
functions with any possible algebraic degrees. Considering that there are
probably no bent-negabent functions in the rotation symmetric class, it is the
first significant attempt to construct bent-negabent functions in the
generalized rotation symmetric class
- …