Almost Enumeration of eight-variable Bent Functions
نویسندگان
چکیده
Bent functions are important cryptographic Boolean functions. In order to enumerate eight-variable bent functions, we solve the following three key problems. Firstly, under the action of AGL(7, 2), we almost completely classify R(4, 7)/R(2, 7). Secondly, we construct all seven-variable plateaued functions from the orbits of R(4, 7)/R(2, 7). Thirdly, we present a fast algorithm to expand plateaued function into bent functions. Based on the results above, it is feasible to enumerate eight-variable bent functions in practice.
منابع مشابه
The Analysis of affinely Equivalent Boolean Functions∗
By Walsh transform, autocorrelation function, decomposition, derivation and modification of truth table, some new invariants are obtained. Based on invariant theory, we get two results: first a general algorithm which can be used to judge if two boolean functions are affinely equivalent and to obtain the affine equivalence relationship if they are equivalent. For example, all 8-variable homogen...
متن کاملCodes, Bent Functions and Permutations Suitable For DES-like Cryptosystems
Almost bent functions oppose an optimum resistance to linear and differential cryptanalysis. We present basic properties of almost bent functions; particularly we give an upper bound on the degree. We develop the “coding theory” point of view for studying the existence of almost bent functions, showing explicitly the links with cyclic codes. We also give new characterizations of almost bent fun...
متن کاملA New Characterization of Almost Bent Functions
We study the functions from F2 into F2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost bent functions are also almost perfect nonlinear, i.e. they also ensure an optimal resistance to differential cryptanalysis but the converse is not true. We here give a necessary and sufficient condition for an almost perfec...
متن کاملOn the q-Bentness of Boolean Functions
For each non-constant q in the set of n-variable Boolean functions, the qtransform of a Boolean function f is related to the Hamming distances from f to the functions obtainable from q by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its q-transform coefficients equal to ±2n/2 (such function is called q-bent). In our early work, we only gave partia...
متن کاملEffective Construction of a Class of Bent Quadratic Boolean Functions
In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form f(x) = ∑ m 2 −1 i=1 Tr n 1 (cix 1+2ei)+Tr n/2 1 (cm/2x 1+2n/2), where n = me, m is even and ci ∈ GF (2 ). For a general m, it is difficult to determine the bentness of these functions. We present the bentness of quadratic Boolean function for two cases: m = 2p and m = 2pq, where p and q ar...
متن کامل