Balanced Boolean Function on 13-variables having Nonlinearity strictly greater than the Bent Concatenation Bound
نویسنده
چکیده
Very recently, Kavut and Yucel identified 9-variable Boolean functions having nonlinearity 242, which is currently the best known. However, any of these functions do not contain any zero in the Walsh spectrum and that is why they cannot be made balanced. We use these functions to construct 13-variable balanced Boolean function having nonlinearity 213−1 − 2 13−1 2 + 2 = 4034 which is strictly greater than the bent concatenation bound. This is the first demonstration of balanced Boolean functions on odd number of variables having nonlinearity strictly greater than the bent concatenation bound for number of input variables less than 15.
منابع مشابه
Construction of n-Variable (n ≡ 2 mod 4) Balanced Boolean Functions With Maximum Absolute Value in Autocorrelation Spectra < 2n/2
In this paper we consider the maximum absolute value ∆f in the autocorrelation spectrum (not considering the zero point) of a function f . In even number of variables n, bent functions possess the highest nonlinearity with ∆f = 0. The long standing open question (for two decades) in this area is to obtain a theoretical construction of balanced functions with ∆f < 2 n 2 . So far there are only a...
متن کاملGeneralized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 Variable Boolean Functions with Nonlinearity 242
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yücel. In this paper, we present several 9-variable Boolean functions having nonlinearity of 242, which we obtain by suitably generalizing the classes of RSBFs an...
متن کامل9-variable Boolean Functions with Nonlinearity 242 in the Generalized Rotation Class
In 2006, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yücel. To improve this nonlinearity result, we have firstly defined some subsets of the n-variable Boolean functions as the “generalized classes of k-RSBFs and k-D...
متن کاملNew Construction for Balanced Boolean Functions with Very High Nonlinearity
In the past twenty years, there were only a few constructions for Boolean functions with nonlinearity exceeding the quadratic bound 2n−1 − 2(n−1)/2 when n is odd (we shall call them Boolean functions with very high nonlinearity). The first basic construction was by Patterson and Wiedemann in 1983, which produced unbalanced function with very high nonlinearity. But for cryptographic applications...
متن کاملHighly Nonlinear Vector Boolean Functions
In this paper we study n-input m-output Boolean functions (abbr. (n,m)-functions) with high nonlinearity. First, we present a basic construction method for a balanced (n,m)-function based on a primitive element in GF (2m). With an iterative procedure, we improve some lower bounds of the maximum nonlinearity of balanced (n,m)-functions. The resulting bounds are larger than the maximum nonlineari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007