Enumeration of 9-variable rotation symmetric Boolean functions having nonlinearity > 240

Kavut, Selcuk
Maitra, Subhamoy
Sarkar, Sumanta
Yücel, Mustafa
The existence of 9-variable Boolean functions having nonlinearity strictly greater than 240 has been shown very recently (May 2006) by Kavut, Maitra and Yucel; a few functions with nonlinearity 241 have been identified by a heuristic search in the class of Rotation Symmetric Boolean Functions (RSBFs). In this paper, using combinatorial results related to the Walsh spectra of RSBFs, we efficiently perform the exhaustive search to enumerate the 9-variable RSBFs having nonlinearity > 240 and found that there are 8 x 189 many functions with nonlinearity 241 and there is no RSBF having nonlinearity > 241. We further prove that among these functions, there are only two which are different up to the affine equivalence. This is found by utilizing the binary nonsingular circulant matrices and their variants. Finally we explain the coding theoretic significance of these functions. This is the first time orphan cosets of R(1, n) having minimum weight 241 are demonstrated for n = 9. Further they provide odd weight orphans for n = 9; earlier these were known for certain n > 11.


Generalized rotation symmetric and dihedral symmetric boolean functions - 9 variable boolean functions with nonlinearity 242
Kavut, Selcuk; Yucel, Melek Diker (2007-12-20)
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 Yucel. In this paper, we present several 9-variable Boolean functions having nonlinearity of 242, which we obtain by suitably generalizing the classes of RSBFs and Dihedral Symmetric Boolean Functions (DSBFs). These functions do not have any zero in the Walsh spectrum values, ...
Kavut, Selcuk; MAİTRA, Subhamoy; Özbudak, Ferruh (2018-01-01)
Construction of Boolean functions on an odd number of variables with nonlinearity exceeding the bent concatenation bound is one of the most difficult combinatorial problems within the domain of Boolean functions. This problem also has deep implications in coding theory and cryptology. Patterson and Wiedemann demonstrated instances of such functions back in 1983. For more than three decades efforts have been channeled into obtaining such instances. For the first time, in this paper we explore nontrivial uppe...
Characterisation and enumeration of a class of semi bent quadratic Boolean functions
KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01)
In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...
Nonlinear congruential pseudorandom number generators based on inversions have been introduced and analysed recently. These generators do not show the simple lattice structure of the widely used linear congruential generators which are too regular for certain simulation purposes. In the present paper a nonlinear congruential generator based on inversions with respect to a power of two modulus is considered. It is shown that the set of points formed by consecutive pseudorandom numbers has a more complicated ...
Permanence of nonautonomous ratio dependent predator prey systems with piecewise constant argument of generalized type
Akhmet, Marat; Xıaoyan, Lıu (2008-01-01)
In this paper, we investigate the dynamics of nonautonomous ratio-dependent predator-prey systems with piecewise constant argument of generalized type (PCAG) [3]. Sufficient conditions are established for some related qualitative properties such as positive invariance, permanence and non-persistence of the systems. Keywords. Piecewise constant argument of generalized type, predator-prey systems, ratio-dependent response, permanence, non-persistence. AMS (MOS) subject classification: 34A36, 34K12, 34K25.
Citation Formats
S. Kavut, S. Maitra, S. Sarkar, and M. Yücel, “Enumeration of 9-variable rotation symmetric Boolean functions having nonlinearity > 240,” 2006, vol. 4329, p. 266, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62927.