On the affine classification of cubic bent functions
نویسنده
چکیده
We consider cubic boolean bent functions, each cubic monomial of which contains the same variable. We investigate canonical forms of these functions under affine transformations of variables. In particular, we refine the affine classification of cubic bent functions of 8 variables. 1 Preliminaries Let Vn be an n-dimensional vector space over the field F2, and Fn be the set of all boolean functions Vn → F2. We identify a function f ∈ Fn of x = (x1, . . . , xn) with its algebraic normal form, that is, a polynomial of the ring F2[x1, . . . , xn] reduced modulo the ideal (x 2 1 − x1, . . . , x 2 n − xn). Denote by deg f the degree of such polynomial. The Walsh–Hadamard transform associates with f ∈ Fn the function
منابع مشابه
Decomposition of bent generalized Boolean functions
A one to one correspondence between regular generalized bent functions from Fn2 to Z2m , and m−tuples of Boolean bent functions is established. This correspondence maps selfdual (resp. anti-self-dual) generalized bent functions to m−tuples of self-dual (resp. anti self-dual) Boolean bent functions. An application to the classification of regular generalized bent functions under the extended aff...
متن کاملAutomorphism group of the set of all bent functions
Boolean function in even number of variables is called bent if it is at the maximal possible Hamming distance from the class of all affine Boolean functions. We have proven that every isometric mapping of the set of all Boolean functions into itself that transforms bent functions into bent functions is a combination of an affine transform of coordinates and an affine shift.
متن کاملOn Second-order Nonlinearities of Some D0 Type Bent Functions
In this paper we study the lower bounds of second-order nonlinearities of bent functions constructed by modifying certain cubic Maiorana-McFarland type bent functions.
متن کاملHyper-bent Functions
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine monomials. In this paper we introduce a new class of bent functions which we call hyper-bent functions. Functions within this class achieve the maximal minimum distance to all the coordinate functions of all bijective mo...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005